高可靠性应急备选路径启发式搜索算法

Heuristic Algorithm for Emergency Candidate Paths With High Reliability

灾前规划备选路径是减少灾后反应时间、避免灾后次生灾害的有效方法.在路径合理性及共同失效(阻断)的约束条件下,借助路段静态旅行时间的估计及可靠性分析,采用启发式搜索方法进行可部分路段重叠的合理备选路集的构建.通过路径搜索中对高风险路段加权进行有效规避,可得到高可靠性的备选路径集合.通过实例说明了该方法的有效性.

Pre-planning a path is an effective way to reduce rescue response time and to keep the post-disaster traffic under control. In the paper, a heuristic path searching algorithm is suggested in order to efficiently preplan good candidate emergency path sets. Every alternative path calculated is checked under the conditions of constrains of both the reasonable path and the alternative path set constraints. The algorithm terminates when any of the alternative path constraints is satisfactory. Using the weight increment procedure, the reliability of the path set and the reliability of candidate paths within the set are increased efficiently.