【摘要】 在迪杰斯特拉(Dijkstra)算法的基础上,针对有较多节点和道路的大网络在求解最短路径时计算时间慢、扩展节点多的缺点,采用基于局部最优方向和A*算法的混合算法,利用局部最优方向法的结果,对A*算法的启发函数加以改造,可以减少扩展的节点数量,快速的找到一条最短路径.通过实验仿真证实了该算法的快速有效性.更多还原

【Abstract】 In order to reduce the time for expanding to obtain a shortest path in a big traffic network which has a lot of nodes and paths,we deduced a hybrid algorithm by the A~* algorithm and local optimal direction method based on Dijkstra’s shortest path algorithm.Using the result of the local optimal direction algorithm,the heuristic function of A~* algorithm was rebuilt.It can reduce the number of expanded nodes and reduce the time for finding the shortest path.Experimental results show that the algorithm is effective and speedy.更多还原