Abstract
Emergency evacuation is the process of movement of people away from the threat or actual occurrence of hazards such as natural disasters, terrorist attacks, fires and bombs. In this paper, we focus on evacuation from a building, but the ideas can be applied to city and region evacuation. We define the problem and show how it can be modeled using graphs. The resulting optimization problem can be formulated as an integer linear program. Though this can be solved exactly, this approach does not scale well for graphs with thousands of nodes and several hundred thousands of edges. This is impractical for large graphs.
We study a special case of this problem, where there is only a single source and a single sink. For this case, we give an improved algorithm Single Source Single Sink Evacuation Route Planner (SSEP), whose evacuation time is always at most that of a famous algorithm Capacity Constrained Route Planner (CCRP), and whose running time is strictly less than that of CCRP. We prove this mathematically and give supporting results by extensive experiments. We also study randomized behavior model of people and give some interesting results.
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
References
Ahmed, N., Ghose, A., Agrawal, A.K., Bhaumik, C., Chandel, V., Kumar, A.: SmartEvacTrak: a people counting and coarse-level localization solution for efficient evacuation of large buildings. In: IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops), pages 372–377. IEEE (2015)
Dressler, D., Groß, M., Kappmeier, J.-P., Kelter, T., Kulbatzki, J., Plümpe, D., Schlechter, G., Schmidt, M., Skutella, M., Temme, S.: On the use of network flow techniques for assigning evacuees to exits. Procedia Eng. 3, 205–215 (2010)
Gupta, A., Sarda, N.L.: Efficient evacuation planning for large cities. In: Decker, H., Lhotská, L., Link, S., Spies, M., Wagner, R.R. (eds.) DEXA 2014, Part I. LNCS, vol. 8644, pp. 211–225. Springer, Heidelberg (2014)
Hamacher, H.W., Tjandra, S.A: Mathematical Modelling of Evacuation Problems: A State of Art. Fraunhofer-Institut für Techno-und Wirtschaftsmathematik, Fraunhofer (ITWM) (2001)
Hoppe, B., Tardos, É.: Polynomial time algorithms for some evacuation problems. In: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, pp. 433–441. Society for Industrial and Applied Mathematics (1994)
Kim, S., Shekhar, S., Min, M.: Contraflow transportation network reconfiguration for evacuation route planning. IEEE Trans. Knowl. Data Eng. 20(8), 1115–1129 (2008)
Løvs, G.G.: Models of wayfinding in emergency evacuations. Eur. J. Oper. Res. 105(3), 371–389 (1998)
Lu, Q., George, B., Shekhar, S.: Capacity constrained routing algorithms for evacuation planning: a summary of results. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 291–307. Springer, Heidelberg (2005)
Min, M.: Synchronized flow-based evacuation route planning. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds.) WASA 2012. LNCS, vol. 7405, pp. 411–422. Springer, Heidelberg (2012)
Min, M., Lee, J.: Maximum throughput flow-based contraflow evacuation routing algorithm. In: IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops), pages 511–516. IEEE (2013)
Min, M., Neupane, B.C.: An evacuation planner algorithm in flat time graphs. In: Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, p. 99. ACM (2011)
Skutella, M.: An introduction to network flows over time. In: Cook, W., Lovász, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 451–482. Springer, Heidelberg (2009)
Song, X., Zhang, Q., Sekimoto, Y., Shibasaki, R., Yuan, N.J., Xie, X.: A simulator of human emergency mobility following disasters: knowledge transfer from big disaster data. In: AAAI Conference on Artificial Intelligence (2015)
Yin, D.: A scalable heuristic for evacuation planning in large road network. In: Proceedings of the Second International Workshop on Computational Transportation Science, pp. 19–24. ACM (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Mishra, G., Mazumdar, S., Pal, A. (2015). Improved Algorithms for the Evacuation Route Planning Problem. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, DZ. (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science(), vol 9486. Springer, Cham. https://doi.org/10.1007/978-3-319-26626-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-26626-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26625-1
Online ISBN: 978-3-319-26626-8
eBook Packages: Computer ScienceComputer Science (R0)