一种基于Dijkstra的实用多路径求解算法

针对传统的多路径求解算法求解的始终是起点到终点的最短路径,搜索区域上一直没有什么变化,效率较低的问题,提出了一种基于Dijkstra的实用多路径搜索算法,只需求解起点到原最短路径上中间节点的最短路径,最后再补充相关路段,便可以得到权值与最短路径相接近的前几条次短路径。最后结合郑州市某区域的交通网络图进行了实例仿真,结果表明该算法是行之有效的。

An Efficient Multiple Path Searching Algorithm Based on Dijkstra

In view of the fact that what the traditional multiple-path searching algorithm solves is from the beginning to the end all the way.The searching region never changes,the efficiency is low.The article proposed one better multiple-path algorithm based on the dijkstra.Finally the simulation to some region of the Zhengzhou road network is carried on,the result has proved the algorithm is feasible and superior.