首页 | 本学科首页   官方微博 | 高级检索  
     

基于路径依赖的最短路径算法的改进与实现
引用本文:张池军,杨永健,赵洪波. 基于路径依赖的最短路径算法的改进与实现[J]. 计算机工程与应用, 2006, 42(25): 56-58
作者姓名:张池军  杨永健  赵洪波
作者单位:吉林大学计算机科学与技术学院,长春,130012;长春税务学院经济信息管理系,长春,130117;吉林大学计算机科学与技术学院,长春,130012
摘    要:在GIS(地理信息系统)领域,对最短路径搜索问题的研究和应用比较多。论文针对GIS领域中通信系统的专线路由选择对节点的数目有严格要求的特点,对Dijkstra算法从路径依赖方面提出了解决方案,主要是从路径长度对最短路径的影响方面进行研究和探索,提出了在弧的权值中加入路径惩罚因子的观点并加以实现。同时对改进算法进行了实验仿真,取得了较为满意的效果。

关 键 词:GIS  最短路径  Dijkstra算法  路径依赖
文章编号:1002-8331-(2006)25-0056-03
收稿时间:2006-05-01
修稿时间:2006-05-01

Improvement and Realization of the Shortest Path Algorithm Based on Path-dependent
ZHANG Chi-jun,YANG Yong-jian,ZHAO Hong-bo. Improvement and Realization of the Shortest Path Algorithm Based on Path-dependent[J]. Computer Engineering and Applications, 2006, 42(25): 56-58
Authors:ZHANG Chi-jun  YANG Yong-jian  ZHAO Hong-bo
Affiliation:1 College of Computer Science and Technology,Jilin University,Changchun 130012;Economics Information Management Department,Changchun Taxation College,Changchun 130117
Abstract:The research and applications about the shortest path are investigated widely in GIS(geography informationsystem) field.In the present study,from the side of the effect of path length on the shortest path,some solutions about path-dependent of Dijkstra algorithm are maken out according to the characteristics of the stern demands for the number of nodes in special wire route choosing of telecommunication in GIS field.Furthermore,it is proposed to add path punishment factor to the weight value of arcs.Simultaneously,the simulation of improved algorithm is conducted,the better results are obtained.
Keywords:GIS
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号