| 栅格地形的最优路径分析 |
| |
| 引用本文： | 鲁敏,张金芳.栅格地形的最优路径分析[J].武汉大学学报(信息科学版),2010(1). |
| |
| 作者姓名： | 鲁敏 张金芳 |
| |
| 作者单位： | 中南财经政法大学信息学院;中国科学院软件研究所综合信息系统技术国家重点实验室; |
| |
| 基金项目： | 中南财经政法大学振兴工程科研基金资助项目 |
| |
| 摘 要： | 将栅格地形根据不同的邻域结构形成稀疏栅格网络和稠密栅格网络,分析了稀疏网络中最优路径问题的建模和基于Dijkstra算法的求解方法,以及稠密网络中最优路径问题的建模和基于模拟退火算法的求解方法。比较了这两种方法求解结果的准确性和效率的差异,发现基于稀疏网络的Dijkstra算法更适合于栅格地形的最优路径问题的求解。
|
| 关 键 词： | 栅格 最优路径 Dijkstra算法 模拟退火算法 |
Least-cost Path Analysis in Raster Terrains |
| |
| LU Min ZHANG Jinfang.Least-cost Path Analysis in Raster Terrains[J].Geomatics and Information Science of Wuhan University,2010(1). |
| |
| Authors: | LU Min ZHANG Jinfang |
| |
| Institution: | LU Min1 ZHANG Jinfang2(1 Information College of Zhongnan University of Economics , Law,1 South Nanhu Road,Wuhan 430073,China)(2 National Key Laboratory of Integrated Information System Technology,Institute of Software,Chinese Academy of Sciences,4 Nansi Street,Zhongguancun,Beijing 100080,China) |
| |
| Abstract: | The raster terrains can be deformed to sparse networks and dense networks according to different neighborhood structures.The least-cost path problems in sparse networks are analyzed,modeled and resolved using the Dijkstra algorithm.Simultaneously the ones in dense networks are analyzed,modeled and resolved by simulated annealing algorithm.The accuracy and efficiency of the results got from the experiments of the two methods were compared and analyzed thoroughly.And the Dijkstra algorithm is proved to be mor... |
| |
| Keywords: | raster least-cost path Dijkstra algorithm simulated annealing algorithm |
| 本文献已被 CNKI 等数据库收录！ |
