| GIS空间分析中两种改进的路径规划算法 |
| |
| 引用本文： | 侯建国,王腾军. GIS空间分析中两种改进的路径规划算法[J]. 地矿测绘, 2008, 24(3) |
| |
| 作者姓名： | 侯建国 王腾军 |
| |
| 作者单位： | 长安大学,地测学院,陕西,西安,710054;黑龙江工程学院,测绘工程系,黑龙江,哈尔滨,150001;长安大学,地测学院,陕西,西安,710054 |
| |
| 摘 要： | 通过对经典Dijkstra算法和启发式搜索的分枝算法各自的不足之处进行分析，并分别对它们进行了改进。利用VC编程进行实验，实验表明：改进的Dijkstra算法可以减少大量的无关节点的计算，使其时间复杂性得到降低，同时运算空间开销也减少；改进的分枝算法则可以提高搜索到最优路径的成功率。
|
| 关 键 词： | 路径规划 GIS 空间分析 Dijkstra算法 分枝算法 |
Two Kinds of Improved Path Planning Algorithms in GIS Spatial Analysis |
| |
| HOU Jiang-guo,WANG Teng-jun. Two Kinds of Improved Path Planning Algorithms in GIS Spatial Analysis[J]. Surveying and Mapping of Geology and Mineral Resources, 2008, 24(3) |
| |
| Authors: | HOU Jiang-guo WANG Teng-jun |
| |
| Abstract: | Based on the analysis of the tradition Dijkstra algorithm's and Branch-and-bound search algorithm,an improved algorithm is given.The experiment in the VC programming shows that the improved Dijkstra algorithm can decrease the computing of uncorrelated nodes and enhances the calculation efficiency and the improved algorithm can find the more optimum path. |
| |
| Keywords: | optimum path planning Geographic Information System(GIS) spatial analysis Dijkstra algorithm branching algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
