A Model-Based Approach and Analysis for Multi-Period Networks

The aim of this contribution is to address a general class of network problems, very common in process systems engineering, where spoilage on arcs and storage in nodes are inevitable as time changes. Having a set of capacities, so-called horizon capacity which limits the total flow passing arcs over all periods, the min-cost flow problem in the discrete-time model with time-varying network parameters is investigated. While assuming a possibility of storage or and spoilage, we propose some approaches employing polyhedrals to obtain optimal solutions for a pre-specified planning horizon. Our methods describe some reformulations based on polyhedrals that lead to LP problems comprising a set of sparse subproblems with exceptional structures. Considering the sparsity and repeating structure of the polyhedrals, algorithmic approaches based on decomposition techniques of block-angular and block-staircase cases are proposed to handle the global problem aiming to reduce the computational resources required.

[1]  Xiaoqiang Cai,et al.  Time-varying network optimization , 2007 .

[2]  Richard Johnsonbaugh,et al.  Foundations of mathematical analysis , 1981 .

[3]  G. Dantzig,et al.  THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[4]  K. Wong,et al.  Selective retardation of perfume oil evaporation from oil-in-water emulsions stabilized by either surfactant or nanoparticles. , 2010, Langmuir : the ACS journal of surfaces and colloids.

[5]  Ignacio E. Grossmann,et al.  Time representations and mathematical models for process scheduling problems , 2011, Comput. Chem. Eng..

[6]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[7]  Ignacio E. Grossmann,et al.  New general continuous-time state-task network formulation for short-term scheduling of multipurpose batch plants , 2003 .

[8]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[9]  Hassan Salehi Fathabadi,et al.  Minimum Cost Flow Problem on Dynamic Multi Generative Network flows , 2010, Algorithmic Oper. Res..

[10]  Bruce Hoppe,et al.  Efficient Dynamic Network Flow Algorithms , 1995 .

[11]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[12]  Jay E. Aronson,et al.  A survey of dynamic network flows , 1989 .

[13]  Said Salhi,et al.  An Efficient Hybrid Genetic Algorithm for the MultiProduct Multi Period Inventory Routing Problem , 2011 .

[14]  Peter L. Jackson,et al.  Revised dantzig-wolfe decomposition for staircase-structured linear programs , 1987, Math. Program..

[15]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[16]  Carlos Eduardo Ferreira,et al.  Decomposing Matrices into Blocks , 1998, SIAM J. Optim..

[17]  Robert G. Bartle,et al.  Introduction to real analysis / Robert G. Bartle , 2002 .

[18]  Ignacio E. Grossmann,et al.  Temporal and spatial Lagrangean decompositions in multi-site, multi-period production planning problems with sequence-dependent changeovers , 2011, Comput. Chem. Eng..

[19]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[20]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[21]  Dmitrii Lozovanu,et al.  Optimization and Multiobjective Control of Time-Discrete Systems: Dynamic Networks and Multilayered Structures , 2009 .

[22]  Haiqing Song,et al.  A Study on The Dynamic Network Flow Problems: With Applications to The Dynamic Resource Managment in Logistics Networks , 2009 .

[23]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[24]  Michael C. Ferris,et al.  Partitioning mathematical programs for parallel solution , 1998, Math. Program..

[25]  Kellen Petersen August.  Real Analysis , 2009 .

[26]  Ignacio E. Grossmann,et al.  A general continuous state task network formulation for short term scheduling of multipurpose batch plants with due dates , 2003 .

[27]  Seyed Ahmad Hosseini,et al.  An introduction to dynamic generative networks: Minimum cost flow , 2011 .

[28]  Hlynur Stefansson,et al.  Production , Manufacturing and Logistics Discrete and continuous time representations and mathematical models for large production scheduling problems : A case study from the pharmaceutical industry , 2011 .

[29]  P. Kettler,et al.  Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms , 1971 .

[30]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[31]  Hanif D. Sherali,et al.  Linear Programming and Network Flows: Bazaraa/Linear , 2009 .

[32]  Duncan J. Watts,et al.  The Structure and Dynamics of Networks: (Princeton Studies in Complexity) , 2006 .

[33]  Michael C. Ferris,et al.  Slice models in general purpose modeling systems: An application to DEA , 2002, Optim. Methods Softw..

[34]  Meta M. Voelker.  OPTIMIZATION OF SLICE MODELS , 2002 .

[35]  R. Sargent,et al.  A general algorithm for short-term scheduling of batch operations */I , 1993 .

[36]  W. A. Poe,et al.  Handbook of Natural Gas Transmission and Processing , 2006 .