An introduction to dynamic generative networks: Minimum cost flow

What we are dealing with is a class of networks called dynamic generative network flows in which the flow commodity is dynamically generated at source nodes and dynamically consumed at sink nodes. As a basic assumption, the source nodes produce the flow according to time generative functions and the sink nodes absorb the flow according to time consumption functions. This paper tries to introduce these networks and formulate minimum cost dynamic flow problem for a pre-specified time horizon T. Finally, some simple, efficient approaches are developed to solve the dynamic problem, in the general form when the capacities and costs are time varying and some other special cases, as a minimum cost static flow problem.

[1]  Lisa Fleischer,et al.  Faster Algorithms for the Quickest Transshipment Problem , 2001, SIAM J. Optim..

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

[3]  George L. Nemhauser,et al.  A Dynamic Network Flow Problem with Uncertain Arc Capacities: Formulation and Problem Structure , 2000, Oper. Res..

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

[5]  Fred W. Glover,et al.  The NETFORM concept: A more effective model form and solution procedure for large scale nonlinear problems , 1977, ACM '77.

[6]  Di Yuan,et al.  A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation , 2003, INFORMS J. Comput..

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

[8]  Lisa Fleischer,et al.  Universally maximum flow with piecewise‐constant capacities , 2001, Networks.

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

[10]  Éva Tardos,et al.  Efficient continuous-time dynamic network flow algorithms , 1998, Oper. Res. Lett..

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

[12]  Éva Tardos,et al.  “The quickest transshipment problem” , 1995, SODA '95.

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

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

[15]  Malachy Carey,et al.  An approach to modelling time-varying flows on congested networks , 2000 .

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

[17]  Hassan Salehi Fathabadi,et al.  MAXIMUM FLOW PROBLEM ON DYNAMIC GENERATIVE NETWORK FLOWS WITH TIME-VARYING BOUNDS , 2010 .

[18]  Maria Fonoberova,et al.  Optimal Flows in Dynamic Networks and Algorithms for their Finding , 2012 .