Urban emergency evacuation path planning considering multi-path combination

doi:10.16265/j.cnki.issn1003-3033.2025.06.1661

Abstract

Abstract:

In order to alleviate the potential congestion problem caused by the sharp increase in evacuation demand on a single shortest path, the multi-path combined evacuation planning scheme considering congestion factors was studied by using Geographic Information System (GIS), Dijkstra algorithm and Yen algorithm. Firstly, the Dijkstra algorithm and the Yen algorithm were used to calculate k shortest evacuation paths from multiple starting points to multiple endpoints. Then, the k shortest paths in each path set are combined with each other to form different evacuation path combination schemes. Finally, the traffic flow of the overlapping sections in the combined route was diverted to reduce congestion, and the optimal combination scheme of evacuation paths was identified. The simulation results show that through calculation, the number of the shortest evacuation paths between each starting and ending point and the total number of evacuation path combination schemes can be obtained. Considering the impact of overlapping sections on evacuation is more in line with the actual situation and can form the optimal combination scheme of evacuation paths.

Key words: combination scheme of evacuation routes, emergency evacuation, route planning, Dijkstra algorithm, overlapping road sections

CLC Number:

X915.2安全社会学

SONG Yinghua, JING Wenxia, LYU Wei, WANG Jinghui, ZHAO Menghan, LIN Haolan. Urban emergency evacuation path planning considering multi-path combination[J]. China Safety Science Journal, 2025, 35(6): 134-141.

Figures/Tables 13

Fig.1

Fig.2

Fig.3

Fig.4

Fig.5

Fig.6

Fig.7

Fig.8

Table 1

Table 2

Fig.9

Fig.10

Fig.11

References 16

[1]	胡文燕, 李梦雅, 王军, 等. 暴雨内涝影响下的城市道路交通拥挤特征识别[J]. 地理科学进展, 2018, 37(6):772-780. doi: 10.18306/dlkxjz.2018.06.004
	HU Wenyan, LI Mengya, WANG Jun, et al. Urban traffic congestion caused by rainstorms and inundation[J]. Progress in Geography, 2018, 37(6):772-780. doi: 10.18306/dlkxjz.2018.06.004
[2]	林毓铭, 李瑾. 中国防灾减灾70年:回顾与诠释[J]. 社会保障研究, 2019(6):37-43.
	LIN Yuming, LI Jin. Disaster prevention and mitigation since the founding of the People's Republic of China for 70 years: review and interpretation[J]. Social Security Studies, 2019(6):37-43.
[3]	VICTOR P, HENTENRYCK P V, EVEN C. A conflict-based path-generation heuristic for evacuation planning[J]. Transportation Research Part B: Methodological, 2016, 83:136-150.
[4]	姜雪, 杨欢, 张培红. 基于蚁群算法的商业步行街应急疏散决策优化[J]. 中国安全科学学报, 2021, 31(10):144-151. doi: 10.16265/j.cnki.issn1003-3033.2021.10.020
	JIANG Xue, YANG Huan, ZHANG Peihong. Emergency evacuation decision optimization for commercial pedestrian streets based on ant colony algorithm[J]. China Safety Science Journal, 2021, 31(10):144-151. doi: 10.16265/j.cnki.issn1003-3033.2021.10.020
[5]	杨剑锋, 展慧, 陈良超, 等. 考虑地震灾害的城市人员密集区域应急疏散路线规划[J]. 清华大学学报:自然科学版, 2022, 62(1):70-76.
	YANG Jianfeng, ZHAN Hui, CHEN Liangchao, et al. Planning of emergency evacuation routes in densely populated urban areas during earthquakes[J]. Journal of Tsinghua University: Science and Technology, 2022, 62(1):70-76.
[6]	LIM G J, RUNGTA M, BAHARNEMATI M R, et al. Reliability analysis of evacuation routes under capacity uncertainty of road links[J]. IIE Transactions, 2015, 47(1):50-63.
[7]	KIM S H, SHEKHAR S, MIN M, et al. Contraflow transportation network reconfiguration for evacuation route planning[J]. IEEE Transactions on Knowledge and Engineering, 2008, 20(8):1115-1129.
[8]	HOSSEINI O, MAGHREBI M, MAGHREBI M F. Determining optimum staged-evacuation schedule considering total evacuation time, congestion severity and fire threats[J]. Safety Science, 2021, 139:1-16.
[9]	李清泉, 李秋萍, 方志祥. 一种基于时空拥挤度的应急疏散路径优化方法[J]. 测绘学报, 2011, 40(4):517-523.
	LI Qingquan, LI Qiuping, FANG Zhixiang. An emergency evacuation routing optimization method based on space-time congestion concept[J]. Acta Geodaetica et Cartographica Sinica, 2011, 40(4):517-523.
[10]	NIYOMUBYEYI O, PILESJO P, MANSOURIAN A. Evacuation planning optimization based on a multi objective artificial bee colony algorithm[J]. International Journal of Geo-Information, 2019, 8(3):1-23.
[11]	CAMPOS V E G. Evacuation transportation planning: a method of identify optimal independent routes[C]. Urban Transport and the Environment for the 21^st Century, 2000:555-564.
[12]	STEPANOV A, SMITH J M. Multi-objective evacuation routing in transportation networks[J]. European Journal of Operational Research, 2009, 198(2):435-446.
[13]	HE Yunyue, LIU Zhong, SHI Jianmai, et al. K-shortest-path-based evacuation routing with police resource allocation in city transportation networks[J]. PLoS One, 2015, 10(7):1-23.
[14]	DUAN Xianghao, WU Jiaxiang, XIONG Yonglin. Dynamic emergency vehicle path planning and traffic evacuation based on salp swarm algorithm[J]. Journal of Advanced Transportation, 2022: DOI:10.1155/2022/7862746.
[15]	何健飞, 刘晓. 基于拥挤度的地铁应急疏散路径优化方法[J]. 中国安全科学学报, 2013, 23(2):166-171.
	HE Jianfei, LIU Xiao. A subway emergency evacuation routing optimization method based on congestion degree[J]. China Safety Science Journal, 2013, 23(2):166-171.
[16]	ROZO K R, ARELLANA J, SANTANDER-MERCADO A, et al. Modelling building emergency evacuation plans considering the dynamic behaviour of pedestrians using agent-based simulation[J]. Safety Science, 2019, 113:276-284.

道路编号	道路等级	道路长度/m	单条道路通行能力/ (pcu·h^-1)	车道数	设计速度/ (km·h^-1)
1	快速路	980	1 750	6	70
2	快速路	875	1 750	6	70
3	快速路	780	1 750	6	70
4	快速路	570	1 750	6	70
5	快速路	170	1 750	6	70
︙	︙	︙	︙	︙	︙
69	支路	388	1 300	2	30
70	次干道	460	1 300	4	40
71	次干道	374	1 300	4	40
72	支路	460	1 300	2	30
73	支路	575	1 300	2	30

起点	终点	路径号	路径	路径长度/m
20	4	1	20→19→18→6→5→4	1 779
		2	20→19→18→17→16→13→4	3 487
		3	20→19→18→17→16→15→12→13→4	4 698
		4	20→19→18→17→5→4	1 957
		5	20→19→7→6→5→4	1 806
		6	20→27→26→25→24→16→13→4	4 519
26	21	1	26→25→24→23→15→14→21	3 812
		2	26→25→24→23→22→21	2 157
		3	26→25→24→23→15→12→11→14→21	4 536
		4	26→25→24→23→15→12→10→9→11→14→21	5 365
		5	26→25→24→16→15→14→21	3 875
		6	26→25→24→28→31→30→22→21	3 535
		7	26→36→35→34→33→30→22→21	3 906
37	42	1	37→36→35→34→33→38→42	3 594
		2	37→36→41→40→39→43→42	3 107
		3	37→36→41→40→44→43→42	3 129
		4	37→36→35→34→39→43→42	3 224
		5	37→46→45→44→43→42	3 319