EconPapers    
Economics at your fingertips  
 

Optimal Evacuation Route Planning of Urban Personnel at Different Risk Levels of Flood Disasters Based on the Improved 3D Dijkstra’s Algorithm

Yang Zhu, Hong Li, Zhenhao Wang, Qihang Li, Zhan Dou, Wei Xie, Zhongrong Zhang (), Renjie Wang and Wen Nie ()
Additional contact information
Yang Zhu: School of Mathematics and Physics, Lanzhou Jiaotong University, Lanzhou 730070, China
Hong Li: Quanzhou Institute of Equipment Manufacturing, Haixi Institutes, Chinese Academy of Sciences, Quanzhou 362000, China
Zhenhao Wang: Quanzhou Institute of Equipment Manufacturing, Haixi Institutes, Chinese Academy of Sciences, Quanzhou 362000, China
Qihang Li: School of Resources and Environmental Engineering, Jiangxi University of Science and Technology, Ganzhou 341000, China
Zhan Dou: Department of Safety Engineering, College of Mechanical and Electrical Engineering, Beijing University of Chemical Technology, Beijing 100029, China
Wei Xie: Quanzhou Institute of Equipment Manufacturing, Haixi Institutes, Chinese Academy of Sciences, Quanzhou 362000, China
Zhongrong Zhang: School of Mathematics and Physics, Lanzhou Jiaotong University, Lanzhou 730070, China
Renjie Wang: School of Mathematics and Physics, Lanzhou Jiaotong University, Lanzhou 730070, China
Wen Nie: Quanzhou Institute of Equipment Manufacturing, Haixi Institutes, Chinese Academy of Sciences, Quanzhou 362000, China

Sustainability, 2022, vol. 14, issue 16, 1-17

Abstract: In the event of a flood, the choice of evacuation routes is vital for personnel security. This is particularly true when road factors play an important role in evacuation time. In this study, the traditional Dijkstra algorithm for route planning is improved, and the evacuation model is improved from 2D to 3D. At the same time, the Lasso regression method is adopted to take the road factors into account in the pedestrian speed, and the location of shelter is selected and optimized through the calculation results, and then based on the improved 3D Dijkstra’s algorithm, an optimal evacuation route method in different flood disasters risk levels is proposed, which can make pedestrians reach the shelters within the shortest time. After taking into account road factors (road width, slope, non-motorized lane width, and pedestrian density), through the calculation of the pedestrian speed formula, the estimated evacuation time of pedestrians is obtained. By combining available shelters with evacuation routes, the optimized algorithm improves the evacuation efficiency facing different risk levels of flood disasters. The results show that when residents are confronted with flood disasters of once-in-20-year, once-in-50-year, and once-in-100-year, the proposed optimization algorithm can save 7.59%, 11.78%, and 17.78% of the evacuation time. Finally, according to the verification of the actual effect in Meishan Town, the proposed method of optimal evacuation route planning can effectively reduce the evacuation time of pedestrians, evaluate, and optimize the location of existing shelter, and provide suggestions for urban road reconstruction.

Keywords: Dijkstra’s algorithm; shelter selection; evacuation time; road factor; optimal evacuation route (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2071-1050/14/16/10250/pdf (application/pdf)
https://www.mdpi.com/2071-1050/14/16/10250/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jsusta:v:14:y:2022:i:16:p:10250-:d:891225

Access Statistics for this article

Sustainability is currently edited by Ms. Alexandra Wu

More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().

 
Page updated 2025-03-19
Handle: RePEc:gam:jsusta:v:14:y:2022:i:16:p:10250-:d:891225