| 3,520 | 60 | 266 |
| 下载次数 | 被引频次 | 阅读次数 |
最短路径算法在各领域广泛应用,传统研究方法主要集中在算法应用及单一优化,将两种优化方法集于一体的算法很少.以兰州—北京的铁路运输系统实例,利用Floyd与Dijkstra算法结合、代码优化的方法优化传统Floyd算法.结果表明:优化后的算法在很大程度上减少了运算次数和时间,提高了算法的时间及空间复杂度,算法效率较高.
Abstract：The Floyd and Dijkstra shortest path algorithms are classical algorithms which have been widely used in spatial analysis and other areas.Traditional research of the shortest path algorithm focuses on the application of the algorithm and the optimization of one kind of algorithm;the combination of two kinds of optimized methods is rarely seen.This paper attempts to use the method of combining the Floyd algorithm with Dijkstra algorithm and the optimization of the code of traditional Floyd algorithm by taking the Lanzhou—Beijing railway transportation system as an example.The spatial-temporal complexities before and after the optimization of the algorithm,are compared.The experimental results show that the optimized algorithm has greatly reduced the computational count and the operational time.As a result,the algorithm efficiency is improved.
[1]Jesper Larsson Traff.An Experimental Comparison of TwoDistributed Single-source Shortest Path Algorithms[J].Par-allel Computing,1995,21:1 505-1 532.
[2]Duin C W.Two Fast Algorithms for All-pairs Shortest Paths[J].Computers&Operations Research,2007,34:2824-2 839.
[3]Tadao Takaoka.Shortest Path Algorithms for Nearly AcyclicDirected Graphs[J].Theoretical Computer Science,1998,203:143-150.
[4]Luis Santos,John R.Current.An Improved Solution Algo-rithm for the Constrained Shortest Path Problem[J].Trans-portation Research Part B,2007,41:756-771.
[5]Xiaobin Wang,Hong Qu,Zhang Yi.A Modified Pulse CoupledNeural Network for Shortest Path Problem[J].Neurocom-puting,2009,72:3 028-3 033.
[6]Roland C.Backhouse,J.P.H.W.Van Den Eijnde,A.J.M.Van Gasteren.Calculating Path Algorithms[J].Science ofComputer Programming,1994,22(1-2):3-19.
[7]A.Moffat,T.Takaoka,An All Pairs Shortest Path Algorithmwith Expected Time O(n2logn)[A].26th Annual Symposiumon Foundation of Computer Science[C]//.Portland:IEEEConforence Publication,1985:101-105.
[8]Shinkoh Okada,Mitsuo Gen.Fuzzy Shortest Path Problem[J].Computers&Industrial Engineering,1994,27(1-4):465-468.
[9]Eugene L.Lawler.Shortest Path and Network Flow Algo-rithms[J].Annals of Discrete Mathematics,1979,4:251-263.
[10]Douglas R.Shier.A computational study of Floyds algorithm[J].Computers&Operations Research,1981,8(4):275-293.
基本信息:
DOI：10.16468/j.cnki.issn1004-0366.2012.04.030
中图分类号:TP301.6
引用信息:
[1]王荣,江东,韩惠.基于Floyd方法的最短路径算法优化算法[J].甘肃科学学报,2012,24(04):110-114.DOI:10.16468/j.cnki.issn1004-0366.2012.04.030.
基金信息:
中国科学院重点部署项目“周边国家及全球资源环境科学数据库建设与决策支持研究”(KZZD-EW-08);; 地震行业科研专项“中国地震应急救援的区域差异性分析”(201208018)