Intelligent Evacuation Route Planning Algorithm Based on Maximum Flow
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Bruce Hoppe & Éva Tardos, 2000. "The Quickest Transshipment Problem," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 36-62, February.
- Carey, Malachy & Subrahmanian, Eswaran, 2000. "An approach to modelling time-varying flows on congested networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(3), pages 157-183, April.
- Pursals, Salvador Casadesús & Garzón, Federico Garriga, 2009. "Optimal building evacuation time considering evacuation routes," European Journal of Operational Research, Elsevier, vol. 192(2), pages 692-699, January.
- Cova, Thomas J. & Johnson, Justin P., 2003. "A network flow model for lane-based evacuation routing," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(7), pages 579-604, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Haotian Zheng & Shuchuan Zhang & Junqi Zhu & Ziyan Zhu & Xin Fang, 2022. "Evacuation in Buildings Based on BIM: Taking a Fire in a University Library as an Example," IJERPH, MDPI, vol. 19(23), pages 1-21, December.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Jianghua Zhang & Yang Liu & Yingxue Zhao & Tianhu Deng, 2020. "Emergency evacuation problem for a multi-source and multi-destination transportation network: mathematical model and case study," Annals of Operations Research, Springer, vol. 291(1), pages 1153-1181, August.
- Urmila Pyakurel & Tanka Nath Dhamala, 2017. "Continuous Dynamic Contraflow Approach for Evacuation Planning," Annals of Operations Research, Springer, vol. 253(1), pages 573-598, June.
- Saadatseresht, Mohammad & Mansourian, Ali & Taleai, Mohammad, 2009. "Evacuation planning using multiobjective evolutionary optimization approach," European Journal of Operational Research, Elsevier, vol. 198(1), pages 305-314, October.
- Lim, Gino J. & Zangeneh, Shabnam & Reza Baharnemati, M. & Assavapokee, Tiravat, 2012. "A capacitated network flow optimization approach for short notice evacuation planning," European Journal of Operational Research, Elsevier, vol. 223(1), pages 234-245.
- Urmila Pyakurel & Stephan Dempe, 2020. "Network Flow with Intermediate Storage: Models and Algorithms," SN Operations Research Forum, Springer, vol. 1(4), pages 1-23, December.
- Mukesh Rungta & Gino Lim & MohammadReza Baharnemati, 2012. "Optimal egress time calculation and path generation for large evacuation networks," Annals of Operations Research, Springer, vol. 201(1), pages 403-421, December.
- Jiang-Hua Zhang & Hai-Yue Liu & Rui Zhu & Yang Liu, 2017. "Emergency Evacuation of Hazardous Chemical Accidents Based on Diffusion Simulation," Complexity, Hindawi, vol. 2017, pages 1-16, December.
- Yuepeng Cui & Hao Xu & Kuangmin Gong, 2023. "A diversion routing optimization model for urban evacuation planning," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 116(2), pages 2399-2416, March.
- Urmila Pyakurel & Hari Nandan Nath & Stephan Dempe & Tanka Nath Dhamala, 2019. "Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal," Mathematics, MDPI, vol. 7(10), pages 1-29, October.
- Zhang, Nan & Huang, Hong & Su, Boni & Zhao, Jinlong, 2015. "Analysis of dynamic road risk for pedestrian evacuation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 430(C), pages 171-183.
- Yuya Higashikawa & Naoki Katoh, 2019. "A Survey on Facility Location Problems in Dynamic Flow Networks," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 163-208, October.
- David Eichler & Hillel Bar-Gera & Meir Blachman, 2013. "Vortex-Based Zero-Conflict Design of Urban Road Networks," Networks and Spatial Economics, Springer, vol. 13(3), pages 229-254, September.
- Fang, Zhixiang & Zong, Xinlu & Li, Qingquan & Li, Qiuping & Xiong, Shengwu, 2011. "Hierarchical multi-objective evacuation routing in stadium using ant colony optimization approach," Journal of Transport Geography, Elsevier, vol. 19(3), pages 443-451.
- Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
- Saurabh Amin & Patrick Jaillet & Haripriya Pulyassary & Manxi Wu, 2023. "Market Design for Capacity Sharing in Networks," Papers 2307.03994, arXiv.org, revised Nov 2024.
- Bellei, Giuseppe & Gentile, Guido & Papola, Natale, 2005. "A within-day dynamic traffic assignment model for urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 39(1), pages 1-29, January.
- Liu, Zhichen & Li, Ying & Zhang, Zhaoyi & Yu, Wenbo, 2022. "A new evacuation accessibility analysis approach based on spatial information," Reliability Engineering and System Safety, Elsevier, vol. 222(C).
- S Opasanon & E Miller-Hooks, 2009. "The Safest Escape problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1749-1758, December.
- Esposito Amideo, A. & Scaparra, M.P. & Kotiadis, K., 2019. "Optimising shelter location and evacuation routing operations: The critical issues," European Journal of Operational Research, Elsevier, vol. 279(2), pages 279-295.
- Hector R. Lim & Ma. Bernadeth B. Lim & Mongkut Piantanakulchai, 2016. "Determinants of household flood evacuation mode choice in a developing country," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 84(1), pages 507-532, October.
More about this item
Keywords
evacuation routing; network flow algorithm; artificial intelligence; route planning;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jijerp:v:19:y:2022:i:13:p:7865-:d:848685. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.