Trip-Based Path Algorithms Using the Transit Network Hierarchy

Alireza Khani, Mark Hickman, Hyunsoo Noh

Research output: Contribution to journalArticlepeer-review

41 Scopus citations


In this paper, we propose a new network representation for modeling schedule-based transit systems. The proposed network representation, called trip-based, uses transit vehicle trips as network edges and takes into account the transfer stop hierarchy in transit networks. Based on the trip-based network, we propose a set of path algorithms for schedule-based transit networks, including algorithms for the shortest path, a logit-based hyperpath, and a transit A*. The algorithms are applied to a large-scale transit network and shown to have better computational performance compared to the existing labeling algorithms.

Original languageEnglish (US)
Pages (from-to)635-653
Number of pages19
JournalNetworks and Spatial Economics
Issue number3
StatePublished - Jul 27 2014

Bibliographical note

Publisher Copyright:
© 2014, Springer Science+Business Media New York.


  • Hyperpath
  • Network hierarchy
  • Public transit modeling
  • Schedule-based transit network
  • Shortest path
  • Transit A*


Dive into the research topics of 'Trip-Based Path Algorithms Using the Transit Network Hierarchy'. Together they form a unique fingerprint.

Cite this