Dijkstra算法在GIS中的优化与应用  

Optimization and Application of Dijkstra's Algorithm in GIS

作　　者：徐鹏 程钢[1] 黎旻懿 XU Peng;CHENG Gang;LI Minyi(Henan Polytechnic University,Jiaozuo Henan 454003,China;Deqing Digital Space Information Technology Company Limited,Deqing Zhejiang 313200,China)

机构地区：[1]河南理工大学测绘与国土信息工程学院,河南焦作454003 [2]德清数联空间信息技术有限公司,浙江德清313200

出　　处：《北京测绘》2021年第6期737-740,共4页Beijing Surveying and Mapping

基　　金：国家自然科学基金(41001226);中国博士后科学基金(2015M582831)。

摘　　要：为了提高出行效率,节省出行时间,避开交通情况复杂路段,基于层次分析法与Dijkstra算法,对多种道路交通影响因素进行对比分析并量化赋值,求解出更加准确、合理并能够动态改变的路径规划方法,该方法利用多元数据分析得出最佳路径,优化以道路长度等单一因素解算的最短路径算法,在实际生活场景中有较强的实用性。实验结果表明,通过优化Dijkstra算法分析的最短路径更为合理,具有广阔的实际应用前景。In order to improve travel efficiency,save travel time,and avoid complex traffic conditions,this paper compared and quantified various road traffic influencing factors based on the analytic hierarchy process and Dijkstra's algorithm,and found a more accurate,reasonable and dynamically changing path Planning method,which applied multivariate data analysis to obtain the best path,optimized the shortest path algorithm based on a single factor such as road length,with strong practicability in real life scenarios.The experimental results showed that the shortest path analyzed by optimizing the Dijkstra's algorithmwas more reasonable and had broader practical application prospects.

关 键 词：DIJKSTRA算法 层次分析法 最短路径 地理信息系统(GIS) 

分 类 号：P215[天文地球—测绘科学与技术]