基于不同交通工具多约束条件的最短路径算法研究

摘要

T he shortest path selection under the multiple constraints can meet user ’ s requirements . However ,there is a big difference among different means of transportation in the same starting point for the shortest path selection .In order to satisfy the user’s travel demand ,in this paper ,the traditional Dijkstra algorithm is improved ,which applies the shortest path query with different traffic tools under multiple constraint condition .In the process of the algorithm improved ,the accuracy of the shortest path selection is optimized .An example shows the final visual result can verify the feasibility and the accuracy of this algorithm .%多约束条件下的最短路径选择可以满足用户的出行需求，然而不同的交通工具在相同起始点下最短路径选择存在很大差异。为了满足多用户的出行需求，基于不同交通工具的多约束条件，对传统的Dijkstra算法进行改进，由传统的基于单约束条件向多约束条件改进，并对最短路径选择的准确程度进行优化。通过实例，验证算法的可行性和准确程度。