区域性疏散中最大灵活度路径识别研究

Study on the Maximum Flexibility Path Identification in Regional Evacuation

对有组织、集体性的区域性疏散问题而言,路径优化是规划阶段的重要内容.按计划路径疏散途中若遇到前方道路封闭或不可用,是否有足够余地(原路径足够灵活)能转入其他路径,是保证疏散安全的关键之一,因此主要研究最大灵活度疏散路径的识别方法,在最短路径的基础上定义有效路径,对网络中的任意节点,用其至终点的有效路径条数表示该节点的灵活度,将路径灵活度表示为其沿途节点灵活度的函数.疏散路径的灵活度越大,意味着中途转向其他有效路径的机会越多.在经典最短路算法基础上进行改进,设计了最大灵活度路径识别的改进算法,并通过数值算例进行了验证.

Path optimization plays an important role in the planning of the organized and collective regional evacuation.If the road ahead is closed or unavailable on the planned route, whether there is enough room(the original path is flexible enough) to turn to other paths is one of the keys to ensure the safety of evacuation.The identification method of the maximum flexibility evacuation path is studied.The effective path is defined based on the shortest path;the flexibility of any node in the network is expressed as the number of available effective paths to the end node;the flexibility of any evacuation path is represented as a function of the flexibility of its nodes along the way.The greater flexibility of evacuation paths means the more chances of halfway turning to other effective paths.The maximum flexibility path recognition algorithm is designed based on the classical shortest-path algorithm and validated by a numerical example.