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 条
  • [1] LIU Meiyin, WANG Jianwei, Pricing method of urban rail transit considering the optimization of passenger transport structure, Journal of Transportation Systems Engineering and Information Technology, 17, 3, pp. 53-59, (2017)
  • [2] XU Wangtu, HE Shiwei, SONG Rui, Et al., Headway and fare model of urban rail transit for integrated operation, Journal of Systems Engineering, 26, 3, pp. 330-339, (2011)
  • [3] DENG Lianbo, WANG Feng, ZHANG Zhao, Et al., Fare optimization for urban rail line, System Engineering-Theory & Practice, 36, 6, pp. 1568-1575, (2016)
  • [4] LIN Xiaoyan, FENG Ying, Rail transit ticket price elasticity in Beijing based on reference-dependent principle, China Industrial Economics, 7, pp. 108-120, (2013)
  • [5] TIAN Guichao, ZHANG Jiantong, HU Yihong, Research on urban rail transit's time differential pricing strategy based on passenger behavior, Shanghai Management Science, 35, 5, pp. 77-83, (2013)
  • [6] CHEN Zhiya, WEN Bangyan, YAN Xiujuan, Et al., Optimal ticket pricing of urban railway transit with public-private partnership aiming at maximum welfare, Journal of Railway Science and Engineering, 15, 9, pp. 2423-2431, (2018)
  • [7] KANG Wenxiong, XU Yaozhao, A hierarchical Dijkstra algorithm for solving shortest path from constrained nodes, Journal of South China University of Technology(Natural Science Edition), 45, 1, pp. 66-73, (2017)
  • [8] LIU Jianmei, MA Shoufeng, MA Shuaiqi, Computation method of the dynamic shortest path based on improved-Dijkstra algorithm, System Engineering-Theory & Practice, 31, 6, pp. 1153-1157, (2011)
  • [9] SZETO W Y, WU Y Z., A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong, European Journal of Operational Research, 209, 2, pp. 141-155, (2011)
  • [10] NIKOLIC M, TEODOROVIC D., Transit network design by bee colony optimization, Expert Systems with Applications, 40, 15, pp. 5945-5955, (2013)
12