启发式最短路径算法研究的.doc

实用标准文案 精彩文档 启发式最短路径算法研究 ——以庐山路网寻径为例 摘 要：最短路径算法的效率是GIS、智能交通系统等应用领域普遍关注和迫切需要解决的问题。在深入分析经典的Dijkstra和启发式最短路径算法的基础上，选取A*启发式最短路径算法，以庐山交通路网为数据基础，对A*算法和Dijkstra算法进行了对比分析和测试。实验结果表明A*算法能够限制条件扩展节点,减少算法遍历的节点数目, 降低执行时间,较经典Dijkstra算法具有更高的效率。在A*启发性算法中，可以将启发函数h(n)看作是节点值估计的约束条件，如果h(n)包含的信息越多或约束条件越多，则排除的节点就越多，估价函数f(n)越好。因此，选择合适的估价函数对算法整体效率有很大影响。 关键词：Dijkstra A* 最短路径算法 Heuristic shortest path algorithm research -- an example of network routing on Mount Abstract: Shortest path algorithm efficiency is application areas such as attention and urgent needs to solve the problem in GIS, intelligent transportation system. In depth analysis of the classical Dijkstra and heuristic shortest path algorithm based on A*, selecting heuristic shortest path algorithm in traffic network on the A * algorithm and Dijkstra algorithm are analyzed and tested as Mount Lu for the data base. The experimental results show that A * algorithm can limit the conditions of extended node traversal algorithm, reduce the number of nodes, reduce the execution time, compared with the classical Dijkstra algorithm has higher efficiency. In A * heuristic algorithm, heuristic function h (n) can be as the node value estimate of the constraints, if h ( n ) contains more information or more constraint conditions, then excluding nodes number, evaluation function f ( n ) as possible.Therefore, choosing the appropriate valuation function on the whole algorithm effi Key words: Dijkstra ;A* ; shortest path algorithm 目录 TOC \o 1-3 \h \z \u HYPERLINK \l _Toc3252583841.序论 PAGEREF _Toc325258384 \h 3 HYPERLINK \l _Toc3252583851.1研究目的和意义 PAGEREF _Toc325258385 \h 3 HYPERLINK \l _Toc3252583861.2国内外研现状 PAGEREF _Toc325258386 \h 4 HYPERLINK \l _Toc3252583872. Dijkstra和启发式最短路径算法研究 PAGEREF _Toc325258387 \h 6 HYPERLINK \l _Toc3252583882.1 图搜索算法和Dijkstra算法 PAGEREF _Toc325258388 \h 6 HYPERLINK \l _Toc3252583892.2启发式算法 PAGEREF _Toc325258389 \h 6 HYPERLINK \l _Toc3252583902.3A*算法 PAGEREF _Toc325258390 \h 7 HYPERLINK \l _Toc3252583912.4A*算