Application of improved Dijkstra algorithm in large urban rail transit network valuation system

被引：0
|
作者：
Xie J. [1 ,2 ]
Chen Z. [1 ]
Deng L. [1 ]
Xie Y. [2 ]
Yang K. [2 ]
机构：
[1] School of Traffic and Transportation Engineering, Central South University, Changsha
[2] Changsha Metro Group Co., Ltd, Changsha
来源：
Guofang Keji Daxue Xuebao/Journal of National University of Defense Technology | 2021年 / 43卷 / 01期
关键词：
Changsha metro line 1~5; Dijkstra algorithm; Shortest path algorithm; Urban subway fare;
D O I：
10.11887/j.cn.202101015
中图分类号：
学科分类号：
摘要：
With the rapid development of urban subway construction, many city subway lines have been networked.Considering the public welfare when making ticket price, most cities in China calculate the ticket price between the two stations of the line network by the shortest path or the least stations now. the traditional Dijkstra algorithm was improved based on the traditional Dijkstra algorithm. The traditional Dijkstra algorithm and the improved Dijkstra algorithm were respectively used to calculate the shortest walking route of Changsha metro line 1~5 network. Results show that the improved Dijkstra algorithm not only effectively improves the efficiency of the algorithm and overcomes the long-time defect of the traditional algorithm, but also partly eliminate the accumulated errors between lines and improve the ductility of the network. © 2021, NUDT Press. All right reserved.
引用
收藏
页码：109 / 116
页数：7
相关论文
共 20 条
  • [11] MIRHASSANI S A, ABOLGHASEMI N., A particle swarm optimization algorithm for open vehicle routing problem, Expert Systems with Applications, 38, 9, pp. 11547-11551, (2011)
  • [12] YU Bin, YANG Zhongzhen, JIN Penghuan, Et al., Transit route network design-maximizing direct and transfer demand density, Transportation Research Part C: Emerging Technologies, 22, pp. 58-75, (2012)
  • [13] PAN Ruoyu, CHU Wei, YANG Shanlin, Metropolitan bus lines optimization and evaluation method based on Dijkstra-PD-ACO algorithm, Chinese Journal of Management Science, 23, 9, pp. 106-115, (2015)
  • [14] LI Yujian, LI Houjun, Hash Dijkstra algorithm for approximate minimal spanning tree, Journal of Beijing University of Technology, 37, 12, pp. 1915-1920, (2011)
  • [15] XU M H, LIU Y Q, HUANG Q L, Et al., An improved Dijkstra's shortest path algorithm for sparse network, Applied Mathematics and Computation, 185, 1, pp. 247-254, (2007)
  • [16] WANG Zhijian, HAN Weiyi, LI Yijun, Shortest path problem with multiple shortest paths, Journal of Harbin Institute of Technology, 42, 9, pp. 1428-1431, (2010)
  • [17] WANG Shiming, XING Jianping, ZHANG Yuting, Et al., Ellipse-based shortest path algorithm for typical urban road networks, System Engineering-Theory & Practice, 31, 6, pp. 1158-1164, (2011)
  • [18] SUNG K, BELL M G H, SEONG M, Et al., Shortest paths in a network with time-dependent flow speeds, European Journal of Operational Research, 121, 1, pp. 32-39, (2000)
  • [19] LI Xueyan, LI Xuemei, LI Xuewei, Bi-level programming for urban rail transit ticket pricing based on cellular automata, Journal of Industrial Engineering and Engineering Management, 31, 1, pp. 155-161, (2017)
  • [20] NASSI C D, COSTA FC C., Use of the analytic hierarchy process to evaluate transit fare system, Research in Transportation Economics, 36, pp. 50-62, (2012)
12