Comparing Effective Path Searching Algorithms for Multi-Modal Public Transport Super-Network

This paper compares two effective path searching algorithms, the Kth shortest path algorithm and the depth-first searching algorithm, for a multi-modal public transport super-network. First, a multi-modal public transport super-network model building method based on the super-network modeling approach is proposed. Then, the procedures of the two algorithms are described in detail. Finally, based on a simplified traffic network representing Wuxi, Jiangsu, in China, a case study is carried out. The differences between the two algorithms are analyzed from the aspects of computing time, effective path searching result for single origin-destination (OD) pair, and effective path searching result for all OD pairs. It is concluded that the depth-first searching algorithm is more accurate and efficient when used to search for the effective paths of a multi-modal public transport super-network.

Language

  • English

Media Info

  • Media Type: Web
  • Features: References;
  • Pagination: pp 743-754
  • Monograph Title: CICTP 2018: Intelligence, Connectivity, and Mobility

Subject/Index Terms

Filing Info

  • Accession Number: 01868110
  • Record Type: Publication
  • ISBN: 9780784481523
  • Files: TRIS, ASCE
  • Created Date: Dec 21 2022 9:16AM