# Approximating Earliest Arrival Flows in Arbitrary Networks

@inproceedings{Gro2012ApproximatingEA,
title={Approximating Earliest Arrival Flows in Arbitrary Networks},
author={Martin Gro{\ss} and Jan-Philipp W. Kappmeier and Daniel R. Schmidt and Melanie Schmidt},
booktitle={ESA},
year={2012}
}
• Published in ESA 10 September 2012
• Computer Science
The earliest arrival flow problem is motivated by evacuation planning. It asks for a flow over time in a network with supplies and demands that maximizes the satisfied demands at every point in time. Gale [1959] has shown the existence of such flows for networks with a single source and sink. For multiple sources and a single sink the existence follows from work by Minieka [1973] and an exact algorithm has been presented by Baumann and Skutella [FOCS '06]. If multiple sinks are present, it is…
Lexicographically optimal earliest arrival flows
A dynamic network introduced by Ford and Fulkerson is a directed graph in which each arc has a capacity and a transit time. The evacuation problem is one of the fundamental problems in a dynamic
Generalizations of Flows over Time with Applications in Evacuation Optimization
An algorithm is presented that computes lexicographically abstract maximum flows and is used to prove existence of abstract earliest arrival flows and the results in [Hof74] are of a theoretical nature and do not allow for a direct polynomial algorithm.
Earliest Arrival Transshipments in Networks with Multiple Sinks
We study a classical flow over time problem that captures the essence of evacuation planning: given a network with capacities and transit times on the arcs and sources/sinks with supplies/demands, an
Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal
• Computer Science
Mathematics
• 2019
The results show that the quickest time to evacuate a flow of value 100,000 units is reduced by more than 42% using the partial contraflow technique, and the difference is more with the increase in the flow value.
A Critical Survey on the Network Optimization Algorithms for Evacuation Planning Problems
• Computer Science
• 2018
This comprehensive survey on evacuation problems complements the number of previous reviews by adding many recent results obtained in the field so far and highlights the main stream research and most promising challenges in modeling and solving more realistic real-life scenarios and explores some possible future research fields.
The Continuous-Time Service Network Design Problem
• Business, Computer Science
Oper. Res.
• 2017
An iterative refinement algorithm using partially time-expanded networks that solves continuous-time service network design problems and demonstrates that the algorithm not only solves problems but also obtains an optimal solution at each point in time.
Network flows and network design in theory and practice
This chapter introduces and investigates abstract flows over time and shows how a temporally repeated abstract flow and a corresponding minimum cut can be computed by solving a single static weighted abstract flow problem— which can be done even when accessing the abstract network through a very limited oracle.
Efficient continuous contraflow algorithms for evacuation planning problems
• Computer Science
Ann. Oper. Res.
• 2017
The continuous maximum abstract contraflow problem is introduced and polynomial time algorithms to solve its static and dynamic versions by reversing the direction of paths are presented.
Continuous Dynamic Contraflow Approach for Evacuation Planning
• Computer Science
Ann. Oper. Res.
• 2017
The proposed newly presented algorithms with continuous contraflow reconfiguration approach increase the flow value for given time horizon and also decrease the evacuation time needed to transship the given flow value.
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
• Computer Science
ITCS '13
• 2013
This work addresses the fact that many problem instances may allow for a much better robustness guarantee than the pathological worst case instances, and presents an algorithm that constructs for each instance a solution with a robustness factor arbitrarily close to optimal.

## References

SHOWING 1-10 OF 20 REFERENCES
Earliest Arrival Flows with Multiple Sources
• Computer Science
Math. Oper. Res.
• 2009
An exact algorithm is presented whose running time is strongly polynomial in the input plus output size of the problem and can be computed by essentially applying the successive shortest-path algorithm for min-cost flow computations.
Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources
• Computer Science
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
• 2006
An exact algorithm is presented for computing an earliest arrival flow for multiple sources for min-cost flow computations whose running time is strongly polynomial in the input plus output size of the problem.
Polynomial time algorithms for some evacuation problems
• Mathematics
SODA '94
• 1994
A polynomial time algorithm is given for the evacuation problem with a fixed number of sources and sinks, and a dynamic flow is sought that lexicographically maximizes the amounts-of flow between sources in a soecified order.
Dynamic network optimization with application to the evacuation problem
This thesis discusses discrete-time dynamic flows over a finite time horizon T, and develops new algorithms to solve several DTDNFPs with time-dependent attributes and develops a new algorithm to solve earliest arrival flow problems with same assumptions on the network attributes.
“The quickest transshipment problem”
• Computer Science
SODA '95
• 1995
The first polynomial-time algorithm for the quickest transshipment problem, which provides an integral optimum flow and is commonly used to model building evacuation.
Generalized Maximum Flows over Time
• Computer Science
WAOA
• 2011
This paper introduces the problem of computing a generalized maximum flow over time in networks with both gain factors and transit times on the arcs and presents a (practically efficient) FPTAS.
Efficient dynamic network flow algorithms
This thesis introduces the first polynomial algorithms to solve several important dynamic network flow problems by computing chain-decomposable flows, a new class of structured dynamic flows and describes the firstPolynomial algorithm to approximate a universally maximum dynamic flow within a factor of (1 + $\epsilon$), for any $\epSilon>0$.
Faster Algorithms for the Quickest Transshipment Problem
This paper shows how to solve the universally quickest transshipment in O(mnlog(n2/m) time, the same asymptotic time as a push-relabel maximum flow computation.
Quickest Flows Over Time
• Computer Science
SIAM J. Comput.
• 2007
The approach yields fully polynomial-time approximation schemes for the NP-hard quickest min-cost and multicommodity flow problems and shows that storage of flow at intermediate nodes is unnecessary, and the approximation schemes do not use any.
The quickest flow problem
• Mathematics, Computer Science
ZOR Methods Model. Oper. Res.
• 1993
It is shown that the quickest flow problem is closely related to the maximum dynamic flow problem and to linear fractional programming problems, and several polynomial algorithms and a stronglyPolynomial algorithm are developed.