交通路网最优路径的搜索仿真研究

RESEARCH ON SIMULATION OF OPTIMAL PATH OF TRAFFIC NETWORK

在道路状况日趋复杂的今天,交通路网中两点之间的最短路径已经不再是人们驾驶所需要的最优路径。传统路径规划方法存在考虑路径规划影响因素过于单一以及搜索效率过低的问题。在路径规划问题中缺少一种在多约束条件下的具体方法来实现交通路网中最优路径的高效搜索。针对上述问题,提出一种基于AHP层次分析法的改进Dijkstra算法。该算法在保有经典Dijkstra算法准确性的基础上,考虑了多种约束条件并大大提升了搜索效率。仿真结果表明,这种基于AHP层次分析法的改进Dijkstra算法具有良好的性能,能够满足当前路径规划问题的要求。

In the increasingly complex road conditions today, the shortest path between two points in the traffic network is no longer the optimal path that people need to drive. The traditional path planning method has the problem that the factors of path planning are too single and the search efficiency is too low. In the path planning problem, there is a lack of a specific method in the multi-constraint conditions to achieve the optimal search path in the traffic network. Aiming at these problems, an improved Dijkstra algorithm based on analytic hierarchy process （AHP） is proposed. Based on the accuracy of the classical Dijkstra algorithm, the algorithm considers various constraints and greatly improves the search efficiency. The simulation results show that the improved Dijkstra algorithm based on AHP has good performance and can meet the requirements of current path planning problems.