[1] Dijkstra E W. A Note on Two Problems in Connexion with Graphs[J]. Numerische Mathematik, 1959, 1(1): 269-271.
[2] Flody R W.Shortest Path[J].Communications of the Association for Computing Machinery, 1962, 15(6): 245.
[3] Hart P E, Nilsson N J, Raphael B A. Formal Basis for the Heuristic Determination of Minimum Cost Paths[J]. IEEE Transactions on Systems Science and Cybernetics, 1968, 4(2): 100-107.
[4] 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.
[5]赖树坤,毛保华.轨道交通系统票务清分算法的研究[J].铁道运输与经济,2007,29(6):42-45.
Lai Shukun, Mao Baohua. Study on Ticket Revenue Clearing Algorithm for Rail Transit System[J]. Railway Transport and Economy, 2007, 29(6): 42-45.
[6]赵峰,张星臣,刘智丽.城市轨道交通系统运费清分方法研究[J].交通运输系统工程与信息,2007,7(6):85-90.
Zhao Feng, Zhang Xingchen, Liu Zhili. Modeling Income Distribution of the Auto Fare Collection System[J]. Journal of Transportation Systems Engineering and Information Technology, 2007, 7(6): 85-90.
[7]徐瑞华,罗钦,高鹏.基于多路径的城市轨道交通网络客流分布模型及算法研究[J].铁道学报,2009,31(2):110-114.
Xu Ruihua, Luo Qin, Gao Peng. Passenger Flow Distribution Model and Algorithm for Urban Rail Transit Network Based on Multi-Route Choice[J]. Journal of the China Railway Society, 2009, 31(2): 110-114.
[8]四兵锋,毛保华,刘智丽.无缝换乘条件下城市轨道交通网络客流分配模型及算法[J].铁道学报,2007,29(6):12-18.
Si Bingfeng, Mao Baohua, Liu Zhili. Passenger Flow Assignment Model and Algorithm for Urban Railway Traffic Network under the Condition of Seamless Transfer[J]. Journal of the China Railway Society, 2007, 29(6): 12-18.
[9]周玮腾,韩宝明.城市轨道交通网络时变路径搜索算法[J].北京交通大学学报,2017,41(4):115-122.
Zhou Weiteng, Han Baoming. Temporal Path Searching Algorithm of Urban Rail Transit Network[J]. Journal of Beijing Jiaotong University, 2017, 41(4): 115-122.
[10]钟璧樯,楼栋,周一威.基于轨道交通网络特点的K最短路算法研究[J].都市快轨交通,2019,32(1):72-77.
Zhong Biqiang, Lou Dong, Zhou Yiwei. Shortest-Path Algorithm Based on the Characteristics of Rail Transit Network[J]. Urban Rapid Rail Transit, 2019, 32(1): 72-77.
|