全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用：99美元
投递稿件

查看量下载量

相关文章

更多...

基于深度优先反向搜索算法确定有效路径集合

DOI: 10.3969/j.issn.1674-0696.2015.03.20, PP. 93-98

Keywords: 交通工程,图论,有效路径,深度优先算法,Floyd算法,trafficengineering,graphtheory,effectivepath,depth-firstsearchalgorithm,Floydalgorithm

Full-Text   Cite this paper   Add to My Lib

Abstract:

:？基于最短路径中任意路段因发生交通事件而失效时的替代路径搜索，合理界定了有效路径的阻抗值范围。参考深度优先算法和有效路径Dail算法离终点越来越近的思想，提出了一种从终点出发，反向搜索前置节点的多条有效路径搜索算法。算例结果表明：该算法能自动识别与路网结构相关的有效路径阻抗值范围，且能快速找到阻抗范围内的有效路径集合。

 References

[1]  Wang Yingjie,Cheng Lin,Wang Wei.Researches on estimations of connectivity reliability of an OD pair based on the effective path sets[J].Journal of Wuhan University of Technology:Transportation Science & Engineering,2009,33(5):960-963.
[2]  杨信丰,刘兰芬.基于影响度的有效路径集合的确定[J].交通运输系统工程与信息,2011,11(6):104-110.
[3]  Yang Xinfeng,Liu Lanfen.Determining the efficient paths based on effect degree[J].Journal of Transportation Systems Engineering and Information Technology,2011,11(6):104-110.
[4]  Lokshtanov D,Mnich M,Saurabh S.Planar k-path in subexponential time and polynomial space[C]//Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science.Teplá-Kláter:Czech Republic,2011:262-270.
[5]  何胜学,范炳全.随机交通分配中有效路径的定向树搜索算法[J].交通与计算机,2005(5):38-41.
[6]  He Shengxue,Fan Bingquan.Orientated tree algorithm of searching efficient paths in stochastic traffic assignment[J].Computer and Communications,2005(5):38-41.
[7]  Leurent F.Curbing the computational difficulty of logit equilibrium assignment model[J].Transportation Research B:Methodological,1997,31(4):315-326.
[8]  李洪波,王茂波.Floyd最短路径算法的动态优化[J].计算机工程与应用,2006(34):60-63.
[9]  Li Hongbo,Wang Maobo.Dynamic optimum of shortest path’s algorithm devised by Floyd[J].Computer Engineering and Applications,2006(34):60-63.
[10]  严晓凤,陆济湘,唐双平.基于Floyd算法的校园最短路径问题分析与实现[J].武汉理工大学学报:信息与管理工程版,2012,34(6):695-703.
[11]  Yan Xiaofeng,Lu Jixiang,Tang Shuangping.Analysis and implementation of campus shortest path based on Floyd algorithm[J].Journal of Wuhan University of Technology:Information & Management Engineering ,2012,34(6):695-703.
[12]  黄美灵, 陆百川.考虑交叉口延误的城市道路最短路径[J].重庆交通大学学报:自然科学版,2009,28(6):1060-1063.
[13]  Huang Meiling,Lu Baichuan.Determination of the shortest path considering delays at intersections[J].Journal of Chongqing Jiaotong University:Natural Science,2009,28(6):1060-1063.
[14]  赖树坤,姚宪辉,彭愚.交通网络中有效路径确定方法的探讨[J].交通标准化,2008(1):137-139.
[15]  Lai Shukun,Yao Xianhui,Peng Yu.Determination of efficient path in traffic network[J].Communications Standardization,2008(1):137-139.
[16]  Evangelista S,Laarman A,Petrucci L,et al.Improved multi-core nested depth-first search[C]∥Automated Technology for Verification and Analysis,Thiruvananthapuram.India:Springer Berlin Heidelberg,2012:269-283.
[17]  Kozen D C.Depth-first and breadth-first search[M]//The Design and Analysis of Algorithms.New York:Springer Berlin Heidelberg,1992:19-24.
[18]  Soo-young J,Chae Y L.Multipath selection and channel assignment in wirelessmesh networks[J].Wireless Netw,2011,17(4):1001-1014.
[19]  王英杰,程琳,王炜.基于有效路径集合的节点间连通度估计方法研究[J].武汉理工大学学报:交通工程与科学版,2009,33(5):960-963.
[20]  李景,彭国雄,臧亦文.改进型多路径分配模型及算法设计[J].系统工程理论与实践,2001(9):130-134.
[21]  Li Jing,Peng Guoxiong,Zang Yiwen.An improved multi-path assignment model and algorithms design [J].Systems Engineering-Theory & Practice,2001(9):130-134.
[22]  黄远春,胥耀方,潘海泽.城际公共交通系统最短路算法[J].重庆交通大学学报:自然科学版,2010,29(2):265-268.
[23]  Huang Yuanchun,Xu Yaofang,Pan Haize.Algorithm for shortest path of intercity public transportation system[J].Journal of Chongqing Jiaotong University:Natural Science,2010,29(2):265-268.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133