Abstract
Evacuation, the process of moving people out of potentially dangerous areas, is a key response to many threats. Planning such an evacuation is therefore important, especially in large-scale emergencies, where routing becomes non-trivial. This paper deals with the optimization and simulation of the evacuation process. We draw our data from the study of the city of Padang in Indonesia, with its high threat of tsunami waves.
Supported by the Federal Ministry for Education and Research (BMBF) under grants 03NAPI4, 03SKPAI6 (“Advest”) and 03G0666E (“last mile”) and by the DFG Research Center MATHEON Mathematics for key technologies in Berlin.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lisa Fleischer and Martin Skutella. Quickest flows over time. SIAM Journal on Computing, 36: 1600–1630, 2007.
L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.
H.W. Hamacher and S.A. Tjandra. Mathematical modelling of evacuation problems – a state of the art. In Pedestrian and Evacuation Dynamics, pages 227–266, 2002.
B. Hoppe and É. Tardos. The quickest transshipment problem. Mathematics of Operations Research, 25: 36–62, 2000.
J. Jarvis and H. Ratliff. Some equivalent objectives for dynamic network flow problems. Management Science, 28: 106–108, 1982.
G. Lämmel and G. Flötteröd. Towards system optimum: finding optimal routing strategies in time dependent networks for large-scale evacuation problems. Volume 5803 of LNCS (LNAI), pages 532–539, Berlin Heidelberg, 2009. Springer.
G. Lämmel, D. Grether, and K. Nagel. The representation and implementation of time-dependent inundation in large-scale microscopic evacuation simulations. Transportation Research Part C: Emerging Technologies, 18: 84–98, February 2010.
K. Nagel and G. Flötteröd. Agent-based traffic assignment: going from trips to behavioral travelers. In Proceedings of 12th International Conference on Travel Behaviour Research, Jaipur, India, December 2009. Invited resource paper.
S. Peeta and H.S. Mahmassani. System optimal and user equilibrium time-dependent traffic assignment in congested networks. Annals of Operations Research, 60: 81–113, 1995.
S. Peeta and A.K. Ziliaskopoulos. Foundations of dynamic traffic assignment: The past, the present and the future. Networks and Spatial Economics, 1: 233–265, 2001.
T. Roughgarden. Selfish Routing and the Price of Anarchy. MIT Press, May 2005.
S.A. Tjandra. Earliest arrival flow with time dependent capacity approach to the evacuation problems. Technical report, TU Kaiserslautern, 2001.
S.A. Tjandra. Dynamic Network Optimization with Application to the Evacuation Problem. PhD thesis, TU Kaiserslautern, 2003.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dressler, D., Flötteröd, G., Lämmel, G., Nagel, K., Skutella, M. (2011). Optimal Evacuation Solutions for Large-Scale Scenarios. In: Hu, B., Morasch, K., Pickl, S., Siegle, M. (eds) Operations Research Proceedings 2010. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20009-0_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-20009-0_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20008-3
Online ISBN: 978-3-642-20009-0
eBook Packages: Business and EconomicsBusiness and Management (R0)