Application of improved Dijkstra algorithm in large urban rail transit network valuation system
CSTR:
Author:
Affiliation:

(1. School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China;2. Changsha Metro Group Co.,Ltd, Changsha 410133, China)

Clc Number:

TN95

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:May 09,2020
  • Revised:
  • Adopted:
  • Online: January 26,2021
  • Published: February 28,2021
Article QR Code