灾害事件下局域路网应急疏散交通分配模型

Traffic Assignment Model of Emergency Evacuation in Local Network against Disaster Affairs

应急疏散的目的是要在灾害发生时将处于危险地带的人群尽快转移至安全地带。针对不同灾害事件类型而引发的单源单汇、单(多)源多汇网络状态的路网疏散问题分别进行了分析。在各路段通行能力的约束条件下,以疏散交通流量最大、总疏散时间最小为优化目标,运用最小费用最大流理论建立了局域路网疏散分配模型。通过实例对模型进行了求解,并在Matlab中得到了实现。通过查找最小截量组成弧的分布位置,并对路网中最小截量组成弧的路段扩容改造,进而有效提高局域路网的应急疏散能力。

The aim of emergency evacuation is to remove residents from the dangerous area to safety one as quickly as possible when disaster occurring. Some problems concerning emergency evacuation in local road network of single source-single terminal or single（multi）source-multiterminal were analyzed respectively for various service states arose from different disaster affairs . With the capacity of each road as the constrain condition, traffic assignment model for local road network was established by using minimum cost max-flow theory to attain optimal target for maximum evacuation traffic volume and minimum evacuation integral time. Traffic assignment model was used by a case and the algorithm was in practice under Matlab. locations of arches which were composed of minimum section set in local road network were found and traffic volume of arches of minimum section set were improved to enhance emergency evacuation ability of local road network efficiently.