论文部分内容阅读
应急疏散的目的是要在灾害发生时将处于危险地带的人群尽快转移至安全地带。由于灾害的扩散,疏散网络中各弧段上的路况将不断恶化,且不同的弧段受到灾害扩散影响的程度也将不同。为此,在提出的应急疏散路径选择模型中,将通过疏散路径所需的总疏散时间最短作为优化目标,将各弧段上的通行速度表示为关于时间的连续递减函数,并对不同弧段的速度函数设置了不同的衰减参数。设计了求解这一时变最短路问题的改进Dijkstra算法并给出了算法的正确性证明,仿真实例说明了模型和算法的有效性和可行性。
The purpose of emergency evacuation is to move people at risk in a safe place as soon as possible when a disaster strikes. Due to the proliferation of disasters, the traffic conditions on the arcs of the evacuation network will continue to deteriorate and the extent of disruption to different arcs will also be different. Therefore, in the proposed emergency evacuation route selection model, the shortest total evacuation time required by the evacuation route is taken as the optimization objective, the passage speed on each arc is expressed as a continuous decreasing function with respect to time, The speed function sets different attenuation parameters. An improved Dijkstra algorithm for solving this shortest-path problem with time-varying problems is proposed and the correctness of the algorithm is proved. The simulation examples show the effectiveness and feasibility of the proposed model and algorithm.