应急资源配送中Dijkstra改进算法的研究

路径规划问题是应急资源配送中的核心问题,最短路径算法在路径规划过程中起着决定性的作用,在众多路径规划算法中最经典且最具代表性的就是Dijkstra算法。以传统的Dijkstra算法分析为基础,从存储结构和算法过程两个方面进行一定程度的改进,目的是在节点数和边数较多的情况下,提高网络模型的处理效率。以真实道路交通数据为基础进行相关实验,结果证明,改进后的Dijkstra算法可以有效减少节点的计算量,提高算法的运行效率。

Research on the Improved Algorithm of Dijkstra in Emergency Resource Distribution

Path planning is the core issue in emergency resource distribution. The shortest path algorithm plays a decisive role in the path planning process. The most classic and most representative path planning algorithm is the Dijkstra algorithm. Based on the traditional Dijkstra algorithm analysis,a certain degree of improvement has been made in storage structure and the algorithm process. The purpose is to improve the efficiency of the network model with more nodes and more edges. Experiments are carried out on the basis of real road traffic data and the results show that the improved Dijkstra algorithm can effectively reduce the calculation of nodes and improve the efficiency of the algorithm.