改进Dijkstra算法在大型城市轨道交通网计价系统中的应用  

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

作　　者：谢建平[1,2] 陈治亚 邓连波[1] 谢宜斌[2] 杨坤 XIE Jianping;CHEN Zhiya;DENG Lianbo;XIE Yibin;YANG Kun(School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China;Changsha Metro Group Co.,Ltd, Changsha 410133, China)

机构地区：[1]中南大学交通运输工程学院,湖南长沙410075 [2]长沙市轨道交通集团有限公司,湖南长沙410133

出　　处：《国防科技大学学报》2021年第1期109-116,共8页Journal of National University of Defense Technology

基　　金：国家自然科学基金资助项目(71471179)。

摘　　要：随着城市地铁建设的迅猛发展,国内众多城市地铁线路均已实现网络化运营。考虑到地铁票价制定的公益性,目前国内大部分城市均以最短路径或最少车站的方式计算线网两车站间的票价。以传统的Dijkstra算法为基准,对传统的Dijkstra算法进行改进,分别采用传统Dijkstra算法和改进Dijkstra算法对长沙地铁1~5号线线网最短距离行走路线进行测算。结果表明,改进后的Dijkstra算法不仅有效地提高了算法的时效性,克服了传统算法时间冗长的缺陷,在一定程度上消除了线路之间累积的误差且提高了线网的可延展性。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.

关 键 词：长沙地铁1~5号线 城市地铁票价 Dijkstra算法 最短路径算法 

分 类 号：TN95[电子电信—信号与信息处理]