全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

一种基于双端队列的交通网络最短路径Pallottino优化算法

DOI: 10.11834/jig.20060367

Keywords: 最短路径,标号算法,Pallottino算法,优先级队列,复杂度

Full-Text   Cite this paper   Add to My Lib

Abstract:

最短路径算法是计算机科学与地理信息科学领域的研究热点,而标号算法则是最短路径算法中的重要一族。长期以来,对于最短路径的算法实现,绝大多数都是围绕以Dijkstra算法为核心的标号设定算法来展开,而对标号改正算法的研究与应用却非常少见。为了对交通网络最短路径进行更有效、更快速的计算,通过对标号改正算法思想的深入分析,针对其中最具代表性的Pallottino算法,从存储结构和运行结构两方面进行了算法的优化改进,同时分析了该算法的时间复杂度和空间复杂度,并利用实际的大规模城市交通网络进行了效率测试。结果显示,与目前公认最优的标号设定算法中基于逼近桶结构的Dijkstra算法相比,该改进的标号改正Pallottino算法具有更好的适用性和更高的运行效率,因此在交通网络最短路径分析应用中具有很高的应用价值。

References

[1]  LU Feng.Shortest path algorithms:taxonomy and advance in research[J].ACTA GEODAETICA et CARTOGRAPHICA SINICA,2001,30(3):269~275.[陆锋.最短路径算法:分类体系与研究进展[J].测绘学报,2001,30(3):269~275.]
[2]  Zhan F B,Noon C E.A comparison between label-setting and labelcorrecting algorithms for computing one-to-one shortest paths[J].Journal of Geographic Information and Decision Analysis,2000,4(2):1 ~13.
[3]  LU Feng,LU Dong-mei,CUI Wei-hong.Improved Dijkstra algorithm based on quad-heap priority queue and inverse adjacent list[J].Journal of Image and Graphics,1999,4A (12):1044 ~ 1050.[陆锋,卢冬梅,崔伟宏.基于四叉堆优先级队列及逆邻接表的改进型Dijkstra算法[J].中国图象图形学报,1999,4A(12):1044~1050.]
[4]  WANG Kai-yi,ZHAO Chun-jiang,XU Gui-xian,et al.A highefficiency realization way of the shortest path search problem in GIS field[J].Journal of Image and Graphics,2003,8A (8):951 ~ 956.[王开义,赵春江,胥桂仙等.GIS领域最短路径搜索问题的一种高效实现[J].中国图象图形学报,2003,8A(8):951~956.]
[5]  Glover F,Glover R,Klingman D.Computational study of an improved shortest path algorithm[J].Networks,1984,14:25 ~ 36.
[6]  Bertsekas D P.A simple and fast label correcting algorithm for shortest paths[J].Network,1993,23:703 ~ 709.
[7]  Gallo G,Pallottino S.Shortest paths algorithms[J].Annals of Operations Research,1988,13:3 ~ 79.
[8]  Deo N,Pang C Y.Shortest-path algorithms:taxonomy and annotation[J].Networks,1984,14:275 ~323.
[9]  Zhan F B,Noon C E.Shortest path algorithms:an evaluation using real road networks[J].Transportation Science,1998,32 (1):65 ~ 73.
[10]  Cherkassky B V,Goldberg A V,Radzik T.Shortest paths algorithms:theory and experimental evaluation[J].Mathematical Programming,1996,73:129 ~ 174.
[11]  YUE Yang,GONG Jian-ya.An efficient implementation of shortest path algorithm based on Dijkstra\'s algorithm[J].Journal of Wuhan Technical University of Surveying and Mapping,1999,24 (3):209~212.[乐阳,龚健雅.Dijkstra最短路径算法的一种高效率实现[J].武汉测绘科技大学学报,1999,24(3):209~212.]
[12]  Pallotlino S.Shortest path methods:complexity,interrelation and new propositions[J].Networks,1984,14:257 ~ 267.
[13]  Goldberg A V,Radzik T.A heuristic improvement of the BellmanFord algorithm[J].Applied Mathematics Letters,1993,6 (3):3~6.
[14]  PAN Jin-gui,GU Tie-cheng,ZENG Jian,et al.Common data structure and algorithmsof modern computer[M].Nanjing:Nanjing University Press,1994.[潘金贵,顾铁成,曾俭等编译.现代计算机常用数据结构和算法[M].南京:南京大学出版社,1994.]

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133