毕业设计-基于DIJKSTRA的最短路径搜索算法的优化及应用论文.doc

毕业设计（论文） 题 目 基于Dijkstra的最短路径搜索算法的优化及应用 姓 名 学 号 专业班级 指导教师 分 院 完成日期 PAGE II 摘 要 最短路径分析是GIS地理网络分析功能中的一个关键问题。Dijkstra算法是计算最短路径的经典算法，是许多工程解决最短路径问题的理论基础。传统Dijkstra算法在求解节点间最短路径时，对已标识节点以外的大量节点进行了计算，从而影响了算法的速度。本文在对传统Dijkstra算法分析的基础上，对其进行了优化，优化算法只对最短路径上节点的邻居做了处理，而不涉及到其他节点。因此，在优化算法中计算的节点数大幅减少，提高了算法的速度。本文通过实验和实际应用对改进后的算法进行了验证。 关键词：最短路径；Dijkstra算法；优化 Abstract Shortest path analysis is the key problem of network analyses， Dijkstra algorithm is a classic arithmetic for the shortest path. It is the academic foundation that many engineerings were solved in the shortest path issue. When a shortest path between nodes is searched with Dijkstra algorithm，a lot of nodes away from lagged nodes are involved，so that the efficiency of Dijkstra algorithm is low．An optimization algorithm is presented in this paper based on analysis of Dijkstra algorithm．Only these nodes that the neighbor of nodes in the shortest path are processed，and other nodes are not processed. Therefore，the number of processed nodes is largely reduced in the optimization algorithm，and efficiency of the optimization algorithm is improved．The improved algorithm is proved to be correct and efficient by experiments and practical application. Keywords: the shortest path；Dijkstra algorithm；optimization PAGE III 目 录 TOC \o 1-4 \h \z \u HYPERLINK \l _Toc201050263 摘 要 PAGEREF _Toc201050263 \h I HYPERLINK \l _Toc201050264 Abstract PAGEREF _Toc201050264 \h II HYPERLINK \l _Toc201050265 第1章 概述 PAGEREF _Toc201050265 \h 1 HYPERLINK \l _Toc201050266 1.1 国内外最短路径算法概况 PAGEREF _Toc201050266 \h 1 HYPERLINK \l _Toc201050267 1.1.1 国内外最短路径研究的主流与方向 PAGEREF _Toc201050267 \h 1 HYPERLINK \l _Toc201050268 1.1.2 国内外主流算法及其简要展开 PAGEREF _Toc201050268 \h 2 HYPERLINK \l _Toc201050269 1.1.2.1 A*算法[3] PAGEREF _Toc201050269 \h 2 HYPERLINK \l _Toc201050270 1.1.2.2 遗传算法[4] PAGEREF _