基于运输时间的Dijkstra算法在应急路径优化中的应用

Application of Dijkstra Algorithm Based on Transport Time in Optimization of Emergency Path

突发事件爆发后,选择最优路径第一时间将救援物资、装备投放到灾区是决策者必须思考的问题,传统的Dijkstra算法仅考虑距离因素难以满足救援的需要。文中以芦山地震为背景,综合考虑节点距离、道路等级、拥堵情况、天气情况,以时间来反应受影响因素的总结果作为节点间路径权重,用Dijkstra算法来求最优路径。

After the outbreak of the incident,it is difficult to choose the best path to carry therelief supplies and equipment to the disaster area. The decision maker must consider this problem. It is difficult to meet the needs of rescue with the traditional Dijkstra algorithm. This paper takes Lushan earthquake as the background,considers the node distance,road grade,congestion,weather conditions,and takes time to reflect the total results of the factors to find out the best path with Dijkstra Algorithm.