全部 标题 作者
关键词 摘要

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

查看量下载量

相关文章

更多...

K则最短路径算法效率与精度评估

DOI: 10.11834/jig.20090832

Keywords: K则最短路径算法,交通网络,效率,精度

Full-Text   Cite this paper   Add to My Lib

Abstract:

精度和效率是决定最短路径算法实用价值的重要依据。对于K则最短路径问题,各种理论严密算法和有损算法的实用性分析是目前研究的薄弱环节。理论严密算法的实际运行效率比较及其有损算法的精度损耗与效率提高幅度的定量化一直未得到深入研究。针对这一问题,在对K则最短路径算法进行系统分类的基础上,分析了各种经典的理论严密算法和精度有损算法的特征与时间复杂度,结合实际城市路网数据对各种K则最短路径算法的运行效率和精度进行了测试和比较。结果显示,与有损算法相比,理论严密的K则最短路径算法普遍缺乏实用性,只有多重标号算法适合于某些要求精度无损的应用;而一些有损K则最短路径算法以较小的精度损失换取了较大幅度的效率提高,尤以双向搜索算法最具应用推广价值。

References

[1]  Shier D R,On algorithms for finding the K shortest paths in a network,Networks,1979(3).
[2]  Juliana Castillo,Analysis and Implementation of K-shortest Path Algorithms in Geographic Information System,Dallas,TX,USA:University of Texas at Dallas,2005.
[3]  Hershberger J,Suri S,Vickrey prices and shortest paths:What is an edge worth,Las Vegas,Nevada,USA,2001.
[4]  基于四叉堆优先级队列及逆邻接表的改进型Dijkstra算法 [J].-中国图象图形学报1999(12)
[5]  陆锋 最短路径算法:分类体系与研究进展 [J].-测绘学报2001(3)
[6]  Hoffman W,Parley R,A method of solution of the Nth best path problem,Journal of the ACM,1959(4).
[7]  柴登峰.张登荣 前N条最短路径问题的算法及应用 [J].-浙江大学学报(工学版)2002(5)
[8]  Eppstein D,Finding the K shortest paths,SIAM Journal on Computing,1999(2).
[9]  Martins E Q V,Santos J L E,A new shortest paths ranking algorithm,Investigacao Operacional,2000(1).
[10]  Santos J L K Shortest Path Algorithms 2006
[11]  Hershberger J.Maxel M.Suri S Finding the K Shortest Simple Paths:A New Algorithm and its Implementation 2003
[12]  戴树贵.陈文兰 一个求解k短路径实用算法 [J].-计算机工程与应用2005(36)
[13]  Martins E Q,Pascoal M M,Santos J L,Deviation algorithms for ranking shortest paths,International Journal of Foundations of Computer Science,1999(3).
[14]  Dreyfus S E,An appraisal of some shortest path algorithms,Operations Research,1969(3).
[15]  Victor Manuel.Jimenez Pelayo.Andres Marzal Varo A Lazy Version of Eppstein\'s K Shortest Paths Algorithm 2003
[16]  王峰.游志胜.曼丽春.高燕.汤丽萍 Dijkstra及基于Dijkstra的前N条最短路径算法在智能交通系统中的应用 [J].-计算机应用研究2006(9)
[17]  袁红涛.朱美正 K优路径的一种求解算法与实现 [J].-计算机工程与应用2004(6)
[18]  Lawler E L,A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem,Management Science,1972(7).
[19]  Katoh N,Ibaraki T,Mine H,An efficient algorithm for K shortest simple paths,Networks,1982(4).
[20]  Yen J Y,Finding the K shortest loopless paths in a network,Management Science,1971(11).
[21]  Martins E Q,An algorithm for ranking paths that may contain cycles,European Journal of Operational Research,1984(1).
[22]  Azevedo J A,Martins E Q v,An algorithm for the ranking of shortest paths,European Journal of Operational Research,1993(1).
[23]  Chong E I.Maddila S R.Morley S T On Finding Single-source Single-destination K Shortest Paths 1995
[24]  Miaou S P,Chin S M,Computing K-shortest path for nuclear spent fuel highway transportation,European Journal of Operational Research,1991(1).
[25]  更多...

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133