摘要
在突发状况下为了快速、安全的疏散轨道交通车站中的客流,将车站抽象成网络图,确定网络图中节点与边的设施,以及各设施的实际疏散能力,基于最短路径优先饱和疏散的思想,设计有效疏散路径算法,并且通过不断调整更新来确定每条路径的实际疏散人数,从而得到最优疏散路径方案。最后以南京市珠江路地铁站为例验证该方案的有效性。
In order to quickly and safely evacuate the pasengers at the rail transit station in the unexpectedcondition,the station is abstracted into a network map to determine its faci l i t ies as a node and edge of thenetwork map and the actual evacuation capability of each facility. Then, the algorithm of effective evacuation paths is designed based on the idea of shortest path and priority to saturation evacuation. Furthermore, the actual evacuation number of each patli is determined by adjusting and updating constantly so as to get theoptimal evacuation patli scheme. Finally, Zhujiang Road subway station in Nanjing City is taken as an exampleto verify the effectiveness of the scheme.
出处
《山东交通学院学报》
CAS
2017年第4期25-31,共7页
Journal of Shandong Jiaotong University
关键词
轨道交通
客流疏散
路径选择
客流分配
rail transit
pas senger evacuation
path choice
passenger flow assignment