中国安全科学学报 ›› 2025, Vol. 35 ›› Issue (6): 134-141.doi: 10.16265/j.cnki.issn1003-3033.2025.06.1661

• 公共安全 • 上一篇    下一篇

考虑多路径组合的城市应急疏散路径规划

宋英华1,2(), 敬文霞1,2, 吕伟1,2,**(), 汪京辉1,2, 赵梦涵1,2, 林皓澜1,2   

  1. 1 武汉理工大学 中国应急管理研究中心,湖北 武汉430070
    2 武汉理工大学 安全科学与应急管理学院,湖北 武汉430070
  • 收稿日期:2025-02-07 修回日期:2025-04-10 出版日期:2025-06-28
  • 通信作者:
    ** 吕伟(1989—),男,河南信阳人,博士,教授,主要从事城市公共安全风险分析、应急资源与人员安全保障(应急交通物流、应急疏散、避难安置)、公共交通风险评估、交通流及行人动力学方面的研究。E-mail:
  • 作者简介:

    宋英华 (1962—),男,湖北武汉人,博士,教授,主要从事公共安全与应急管理、公共管理、协同决策等方面的研究。E-mail:

  • 基金资助:
    国家自然科学基金(52072286); 中央高校基本科研业务费(2024AQYJA10)

Urban emergency evacuation path planning considering multi-path combination

SONG Yinghua1,2(), JING Wenxia1,2, LYU Wei1,2,**(), WANG Jinghui1,2, ZHAO Menghan1,2, LIN Haolan1,2   

  1. 1 China Emergency Management Research Center, Wuhan University of Technology, Wuhan Hubei 430070, China
    2 School of Safety Science and Emergency Management, Wuhan University of Technology, Wuhan Hubei 430070, China
  • Received:2025-02-07 Revised:2025-04-10 Published:2025-06-28

摘要:

为缓解单条最短路径上因疏散需求激增导致的潜在拥堵问题,利用地理信息系统(GIS)、Dijkstra算法和Yen算法,考虑拥堵因素规划多路径组合疏散方案。首先,利用Dijkstra算法和Yen算法计算得到多个起点到多个终点的k条最短疏散路径;然后,组合各路径集合中的k条最短路径,得到不同的疏散路径组合方案;最后,分流组合路线中的重叠路段流量,进而找出最优的疏散路径组合方案。结果表明:通过组合疏散路径,可以得出多源多汇场景下的多条最短疏散路径;考虑重叠路段对疏散的影响,更符合实际情况,可以形成最优的疏散路径组合方案。

关键词: 疏散路径组合方案, 应急疏散, 路径规划, Dijkstra算法, 重叠路段

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

中图分类号: