Earliest Arrival Flows with Multiple Sources

Earliest arrival flows capture the essence of evacuation planning. Given a network with capacities and transit times on the arcs, a subset of source nodes with supplies and a sink node, the task is to send the given supplies from the sources to the sink “as quickly as possible.” The latter requirement is made more precise by the earliest arrival property, which requires that the total amount of flow that has arrived at the sink is maximal for all points in time simultaneously. It is a classical result from the 1970s that, for the special case of a single source node, earliest arrival flows do exist and can be computed by essentially applying the successive shortest-path algorithm for min-cost flow computations. Although it has previously been observed that an earliest arrival flow still exists for multiple sources, the problem of computing one efficiently has been open for many years. We present an exact algorithm for this problem whose running time is strongly polynomial in the input plus output size of the problem.

[1]  James B. Orlin,et al.  A faster strongly polynomial time algorithm for submodular function minimization , 2007, Math. Program..

[2]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[3]  Satoru Iwata,et al.  A push-relabel framework for submodular function minimization and applications to parametric optimization , 2003, Discret. Appl. Math..

[4]  Horst W. Hamacher,et al.  On the use of lexicographic min cost flows in evacuation modeling. , 1987 .

[5]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

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

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

[8]  Nimrod Megiddo,et al.  Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..

[9]  Martin Skutella,et al.  The Quickest Multicommodity Flow Problem , 2002, IPCO.

[10]  M. Padberg.  Linear Optimization and Extensions , 1995 .

[11]  Stevanus Adrianto Tjandra.  Dynamic network optimization with application to the evacuation problem , 2003 .

[12]  David Gale,et al.  Transient flows in networks. , 1959 .

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

[14]  Nimrod Megiddo,et al.  Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..

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

[16]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[17]  Martin Skutella,et al.  Quickest Flows Over Time , 2007, SIAM J. Comput..

[18]  Geoffrey N. Berlin,et al.  The use of directed routes for assessing escape potential , 1978 .

[19]  W. L. Wilkinson,et al.  An Algorithm for Universal Maximal Dynamic Flows in a Network , 1971, Oper. Res..

[20]  Nimrod Megiddo.  Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[21]  Martin Skutella,et al.  Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[22]  Satoru Iwata,et al.  A fully combinatorial algorithm for submodular function minimization , 2001, SODA '02.

[23]  M. Iri.  A NEW METHOD OF SOLVING TRANSPORTATION· NETWORK PROBLEMS , 1960 .

[24]  Bruce E. Hajek,et al.  Optimal dynamic routing in communication networks with continuous traffic , 1982, 1982 21st IEEE Conference on Decision and Control.

[25]  Martin Skutella,et al.  An Introduction to Network Flows over Time , 2008, Bonn Workshop of Combinatorial Optimization.

[26]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[27]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[28]  Edward Minieka,et al.  Maximal, Lexicographic, and Dynamic Network Flows , 1973, Oper. Res..

[29]  Éva Tardos,et al.  Polynomial time algorithms for some evacuation problems , 1994, SODA '94.

[30]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[31]  Richard L. Francis,et al.  Network models for building evacuation , 1982 .

[32]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

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

[34]  H. D. Ratliff,et al.  Note—Some Equivalent Objectives for Dynamic Network Flow Problems , 1982 .