Abstract
In this paper we combine two modeling tools to predict and evaluate evacuation plans: (dynamic) network flows and locational analysis. We present three exact algorithms to solve the single facility version 1-FlowLoc of this problem and compare their running times. After proving the \(\mathcal{NP}\)-completeness of the multi facility q-FlowLoc problem, a mixed integer programming formulation and a heuristic for q-FlowLoc are proposed. The paper is concluded by discussing some generalizations of the FlowLoc problem, such as the multi-terminal problem, interdiction problem, the parametric problem and the generalization of the FlowLoc problem to matroids.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
19 Tote bei Massenpanik auf Loveparade. (2010). http://www.tagesschau.de/inland/loveparade114.html. tagesschau.de (07-19-2010).
Ahuja, R., Magnanti, T., & Orlin, J. (1988). Network flows. Massachusetts Institute of Technology, OR Center.
Batty, M., DeSyllas, J., & Duxbury, E. (2002). The discrete dynamics of small-scale spatial events: agent-based models of mobility in carnivals and street parades (Tech. rep.). University College London.
Batty, M., Desyllas, J., & Duxbury, E. (2003). Safety in numbers? Modelling crowds and designing control for the Notting Hill Carnival. Urban Studies, 40(8), 1573–1590.
Baumann, N. (2007). Evacuation by earliest arrival flows. Ph.D. thesis, Universität Dortmund.
Bloomberg, M. R., & Burden, A. M. (2006). New York City pedestrian level of service study phase I (Tech. rep.). City of New York.
Boer, L., & Skjong, R. (2001). Emergency evacuation: how better interior design can improve passenger flow. In Proceedings, cruise & ferry conference (Vol. 587, pp. 8–10).
Burkard, R., & Dlaska, K. K. B. (1993). The quickest flow problem. Mathematical Methods of Operational Research, 37, 31–58.
Burkard, R. E., & Hamacher, H. W. (1980). Minimal cost flows in regular matroids. Mathematical Programming Studies, 14, 32–47.
Chalmet, L., Francis, R., & Saunders, P. (1982). Network model for building evacuation. Fire Technology, 18(1), 90–113.
Dijkstra, J., Timmermans, H., & Jessurun, A. (2000). A multi-agent cellular automata system for visualising simulated pedestrian activity. In Proceedings on the 4th international conference on cellular automata for research and industry (pp. 4–6).
Ford, L. Jr., & Fulkerson, D. (1958). Constructing maximal dynamic flows from static flows. Operations Research, 6(3), 419–433.
Ford, L. Jr., & Fulkerson, D. (1962). Flows in networks. Physics Today, 16, 54.
Fromme, C., & Schreckenberg, M. (2010). Die Treppe hätte man sprengen müssen. http://www.sueddeutsche.de/wissen/loveparade-experte-zur-ungluecksursache-die-treppe-haette-man-sprengen-muessen-1.979428. sueddeutsche.de (07-19-2010).
Hamacher, H. W. (1980). Algebraic flows in regular matroids. Discrete Applied Mathematics, 2(1), 27–38.
Hamacher, H. (1986). Maximal dynamic polymatroid flows. Discrete Applied Mathematics, 15, 41–54.
Hamacher, H., & Tjandra, S. (2001). Mathematical modelling of evacuation problems—a state of the art. In Berichte des Fraunhofer ITWM (Vol. 42).
Hamacher, H. W., Heller, S., & Ruzika, S. (2010). A sandwich approach for evacuation time bounds. In PED 2010 conference proceedings.
Heller, S., & Hamacher, H. W. (2011). The multi terminal q-FlowLoc problem: A heuristic. In Lecture notes in computer science: Vol. 6701. Proceedings of the international network optimization conference (INOC 2011) (pp. 523–528). Berlin: Springer.
Israeli, E., & Wood, R. K. (2002). Shortest-path network interdiction. Networks, 40(2), 97–111. doi:10.1002/net.10039.
Krause, A. S. (2010). Dynamic location problems: survey and special algorithms. Diploma thesis, TU Kaiserslautern.
Lim, C., & Smith, J. (2007). Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Transactions, 39(1), 15–26.
McMasters, A. W., & Mustin, T. M. (2006). Optimal interdiction of a supply network. Naval Research Logistics Quarterly, 17(3), 261–268.
Rupp, B. (2010). FlowLoc: Discrete facility locations in flow networks. Diploma thesis, TU Kaiserslautern.
Sehburger, K. (2011). Duality issues in FlowLoc problems: the tension-location problem. Diploma thesis, TU Kaiserslautern.
Strategien gegen die Massenpanik. (2010). br-online (07-19-2010).
Tjandra, S. A. (2003). Dynamic network optimization with application to the evacuation problem. Ph.D. thesis, TU Kaiserslautern.
Washburn, A., & Wood, R. K. (1995). Two-person zero-sum games for network interdiction. Operations Research, 43(2), 243–251.
Wilkinson, W. L. (1971). An algorithm for universal maximal dynamic flows in a network. Operations Research, 19(7), 1602–1612.
Wood, R. K. (1993). Deterministic network interdiction. Mathematical and Computer Modelling, 17(2), 1–18. doi:10.1016/0895-7177(93)90236-R.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hamacher, H.W., Heller, S. & Rupp, B. Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning. Ann Oper Res 207, 161–180 (2013). https://doi.org/10.1007/s10479-011-0953-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-0953-9