[1]HOFFMAN W,PAVLEY R.A method for the solution of the nth best path problem[J].Journal of the ACM,1959,6(4):506-514.
[2]徐涛,丁晓璐,李建伏.K最短路径算法综述[J].计算机工程与设计,2013,34(11):3900-3906.
[3]YEN J Y.Finding the K shortest loopless paths in a network[J].Management Science,1971,17(11):712-716.
[4]四兵锋,毛保华,刘智丽.无缝换乘条件下城市轨道交通网络客流分配模型及算法[J].铁道学报,2007,29(6):12-18.
[5]四兵锋,高亮,毛保华.无缝换乘的城市轨道交通运费清分模型及算法[J].管理科学学报,2009,12(5):36-43.
[6]韩雪,刘英舜,郭唐仪.城市轨道交通网络中断下的有效路径搜索模型[J].公路交通科技,2015,32(10):97-101.
[7]刘剑锋,孙福亮,柏赟,等.城市轨道交通乘客路径选择模型及算法[J].交通运输系统工程与信息,2009,9(2):81-86.
[8]徐瑞华,罗钦,高鹏.基于多路径的城市轨道交通网络客流分布模型及算法研究[J].铁道学报,2009,31(2):110-114.
[9]BELLMAN R E.Dynamic programming[M].Princeton,USA:Princeton University Press,1957.
[10]YONGTAEK L,HYUNMYUNG K.A shortest path algorithm for real road network based on path overlap[J].Journal of the Eastern Asia Society for Transportation Studies,2005,6:1426-1438.
[11]任刚,王炜,邓卫.带转向延误和限制的最短路径问题及其求解方法[J].东南大学学报(自然科学版),2004,34(1):104-108.
[12]高松,陆锋.基于弧段标记的交通网络时间最短路径算法[J].地球信息科学,2008,10(5):604-609.
[13]MARTINS E Q V,PASCOAL M M B.A new implementation of Yen’s ranking loopless paths algorithm[J].Quarterly Journal of the Belgian French and Italian Operations Research Societies,2003,1(2):121-133.
[14]李敬贤,厉小润.求解震后最优路径的改进Dijkstra算法[J].计算机工程,2012,38(6):271-272.
[15]TANG J M,SUN Q X,CHEN Z J.A new implementation of Dijkstra’s algorithm on urban rail transit network[C]//Proceedings of International Conference on Civil,Trans-portation and Environment.Pairs,France:Atlantis Press,2016. |