Abstract
Recently, emergency evacuation management, which is a social work around the world, has been getting lots of attentions due to its importance and necessity. The primary task of emergency evacuation management is evacuation route planning. Considering the particularity of restrict space scenarios, it is more important to guarantee the security and promptness of evacuation routes than that in open space scenarios. In this paper, we introduce a new evacuation route planning problem in restricted spaces, namely Congestion-Avoidable Evacuation Route Network Planning (CA-ERNP) problem. Based on the minimum cost maximum flow (Min-Max Flow) problem, we propose a batch scheduling algorithm based on node-slitting transformation. In addition, we evaluate the average performance of the algorithms via simulation and the results indicate the proposed algorithm outperforms the existing alternatives in terms of efficiency and time cost.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Evans, J.: Optimization Algorithms for Networks and Graphs, 2nd edn. Marcel Dekker, New York (1992)
Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73(2), 129–174 (1996)
Jalali, S.E., Noroozi, M.: Determination of the optimal escape routes of underground mine networks in emergency cases. Saf. Sci. 47, 1077–1082 (2009)
Martins, E.D.Q.V., Queir, E., Dos Santos, J.L.E., Martins, V., Margarida, M., Pascoal, M.M.B.: A new algorithm for ranking loopless paths. Technical report, Univ. de Coimbra (1997)
Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652–673 (1998)
Jin, W., Chen, S., Jiang, H.: Finding the K shortest paths in a time-schedule network with constraints on arcs. Comput. Oper. Res. 40, 2975–2982 (2013)
Sever, D., Dellaert, N., Van Woensel, T., De Kok, T.: Dynamic shortest path problems: hybrid routing policies considering network disruptions. Comput. Oper. Res. 40, 2852–2863 (2013)
Hong, Y., Li, D., Wu, Q., Xu, H. Dynamic route network planning problem for emergency evacuation in restricted space scenarios. J. Adv. Transp. Article ID 4295419, 13 p. (2018)
Hong, Y., Li, D., Wu, Q., Xu, H.: Priority-oriented route network planning for evacuation in constrained space scenarios. J. Optim. Theory Appl. (2018). https://doi.org/10.1007/s10957-018-1386-2
Vogiatzis, C., Walteros, J.L., Pardalos, P.M.: Evacuation through clustering techniques. In: Goldengorin, B., Kalyagin, V., Pardalos, P. (eds.) Models, Algorithms, and Technologies for Network Analysis. Springer Proceedings in Mathematics & Statistics, vol. 32, pp. 185–198. Springer, New York (2013). https://doi.org/10.1007/978-1-4614-5574-5_10
Lujak, M., Giordani, S.: Centrality measures for evacuation: finding agile evacuation routes. Futur. Gener. Comput. Syst. 83, 401–412 (2018)
Vogiatzis, C., Pardalos, P.M.: Evacuation modeling and betweenness centrality. In: Kotsireas, I., Nagurney, A., Pardalos, P. (eds.) DOD 2015 2016. Springer Proceedings in Mathematics & Statistics, vol. 185, pp. 345–359. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-43709-5_17
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Upper Saddle River (1993). ISBN 0-13-617549-X
Klein, M.: A primal method for minimal cost flows with applications to the assignment and transportation problems. Manag. Sci. 14, 205–220 (1967)
Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. ACM 36(4), 873–886 (1989)
Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248–264 (1972)
Orlin, J.B.: A polynomial time primal network simplex algorithm for minimum cost flows. Math. Program. 78, 109–129 (1997)
Tanka Nath Dhamala: A survey on models and algorithms for discrete evacuation planning network problems. J. Ind. Manag. Optim. 11(1), 265–289 (2015)
Choi, W., Hamacher, H.W., Tufekci, S.: Modeling of building evacuation problems by network flows with side constraints. Eur. J. Oper. Res. 35(1), 98–110 (1988)
Liu, Y., Chang, G.L., Liu, Y., Lai, X.: Corridor-based emergency evacuation system for Washington, DC: system development and case study. Transp. Res. Rec.: J. Transp. Res. Board 2041, 58–67 (2008)
Acknowledgment
This research was supported in part by Beijing Natural Science Foundation (4174090), Program of Beijing Excellent Talents Training for Young Scholar (2016000020124G056).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Hong, Y., Liu, J., Luo, C., Li, D. (2018). Min-Max-Flow Based Algorithm for Evacuation Network Planning in Restricted Spaces. In: Kim, D., Uma, R., Zelikovsky, A. (eds) Combinatorial Optimization and Applications. COCOA 2018. Lecture Notes in Computer Science(), vol 11346. Springer, Cham. https://doi.org/10.1007/978-3-030-04651-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-04651-4_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04650-7
Online ISBN: 978-3-030-04651-4
eBook Packages: Computer ScienceComputer Science (R0)