改进的Dijkstra最短路径算法在GIS-T中的研究与实现

Research and implementation of the improved Dijkstra shortest path algorithm in GIS-T

Dijkstra最短路径算法广泛应用于交通运输和网络优化等领域,但是在实际应用的过程中仍存在一些不足。文章针对道路拥挤、交叉路口等待和单行道限行等方面提出了一种改进的基于时间最短的最短路径算法。传统的最短路径算法中图的顶点是抽象的,不含权重的,改进的算法中图的顶点是有权值的,用来表示道路交叉口的等待时间。通过编程实现该算法,实验结果表明,道路拥挤、交叉口等待和单行道限行对交通路径选择有很大影响。因此,改进的算法求得的最短时间路径更加符合实际,具有一定的应用价值。

Dijkstra shortest path algorithm（DSPA） is widely used in fields of communication and transportation and network optimization, etc. But there are still some shortcomings in the process of practical application. We propose an improved SPA based on the minimum duration which is directing at the aspects such as congested roads, the intersection waiting and one-way street restrictions. The vertex of diagram in tradition SPA is abstract and does not contain the weight, while does and is used to represent the intersections waiting time in improved algorithm.We program to implement it and the results show that the above three aspects mentioned has a great influence on choice of the transportation route. Therefore, the shortest time path wh3ich is gained by the improved algorithm is more in line with the actual and the improved algorithm has a certain application value.