许涛, 张堃, 刘雷, 徐栋. 一种应用协同优化策略的有组织疏散方案[J]. 武汉大学学报 ( 信息科学版), 2021, 46(5): 691-699. DOI: 10.13203/j.whugis20200443
引用本文: 许涛, 张堃, 刘雷, 徐栋. 一种应用协同优化策略的有组织疏散方案[J]. 武汉大学学报 ( 信息科学版), 2021, 46(5): 691-699. DOI: 10.13203/j.whugis20200443
XU Tao, ZHANG Kun, LIU Lei, XU Dong. An Organized Evacuation Plans with Collaborative Optimization Strategy[J]. Geomatics and Information Science of Wuhan University, 2021, 46(5): 691-699. DOI: 10.13203/j.whugis20200443
Citation: XU Tao, ZHANG Kun, LIU Lei, XU Dong. An Organized Evacuation Plans with Collaborative Optimization Strategy[J]. Geomatics and Information Science of Wuhan University, 2021, 46(5): 691-699. DOI: 10.13203/j.whugis20200443

一种应用协同优化策略的有组织疏散方案

An Organized Evacuation Plans with Collaborative Optimization Strategy

  • 摘要: 随着城市化建设水平的不断提高,城市结构日趋复杂,给城市应急疏散的设计和实施带来困难和挑战。针对复杂城市道路网络中高密度人群的多出口疏散问题,以疏散时长和拥堵时长为优化目标,提出了一种基于协同优化的有组织疏散方案。首先,对道路网络和疏散人群进行建模;接着,为每个疏散组分配疏散出口和最短路线;然后,针对出口占用不平衡问题,对部分疏散组的出口进行协同再分配;最后,应用协同优化策略,根据道路拥堵情况计算疏散组的最快路线。模拟实验分析了多出口和多人数因素对疏散效果的影响,揭示了所提方案的有用性。与已有方案的对比实验表明,所提方案在疏散总时长和平均拥堵时长等指标上具有明显优势。

     

    Abstract:
      Objectives  With the development of urbanization, urban structure and traffic conditions are becoming more and more complex, and it is difficult to design and implement of urban emergency evacuation. Based on existing research results, we propose a novel organized evacuation plans with collaborative optimization strategy, named OrCOS.
      Methods  The object of the OrCOS is the dense crowd in the city which needs to be evacuated immediately. With some strategies about collaborative exits allocating and path planning, OrCOS can reduce the evacuation time and the congestion time of evacuees, and achieve the more efficient evacuation plan. The idea of OrCOS is as follows: (1) Model urban road network and evacuees. Urban road network is defined as vertex‑arc network and residents of one city block are abstracted as an evacuee group with consistent moving features. (2) Determine the shortest path of each evacuee group. Based on the Floyd's shortest path algorithm, the nearest exit and the shortest path of each evacuee group can be determined.(3)Smooth the difference of occupancy time between exits by reallocating exits of specific evacuee groups until the difference is minimized. (4) Re‑plan evacuation route of each group. Because of the interference between evacuee groups, the groups' fastest path need to be replaned to optimize evacuation time.
      Results  Some experiments are carried out in a simulated road network with 247 vertexes and 312 road arcs (449.8 km in total). The total evacuation time (T) and the average congestion time (Tc) are analyzed. Experimental results show that: (1) T and Tc decrease with the increase of the exits' number. When 8 exits are employed, 490 thousand people need 35 min to complete the evacuation. (2) T and Tc increase with the number of evacuees. With 3 exits, 2.44 million evacuees take 4 hours 22 minutes to complete evacuation. In addition, we also conduct comparison experiments between the shortest path evacuation scheme (SE), the staged multi‑exit evacuation scheme(SRE), and OrCOS, to show the differences of T, Tc, and the algorithm running time (Tr), which show that: (1)In most cases, OrCOS often has shorter T than others, especially when the number of evacuees is larger. (2)OrCOS has the slightly better Tc than SRE, and SE has the worst Tc. (3)OrCOS has the worst Tr than others, because of its huge demand for collaborative computing. In summary, OrCOS has stronger ability of evacuation than SE and SRE.
      Conclusions  We propose a novel method: OrCOS, by collaborative optimization strategy, which provide an efficient evacuation plan for urban emergency evacuation. Experimental results demonstrate that OrCOS has better performance in urban road network. It provides a new idea for the multi‑exits simultaneous evacuation in high‑density crowd scene.

     

/

返回文章
返回