Trip-Based Path Algorithms Using the Transit Network Hierarchy.

Khani, Alireza; Hickman, Mark; Noh, Hyunsoo

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.

PUBLIC transit; ALGORITHMS; VOYAGES & travels; LOGITS; TRANSPORTATION research

Networks & Spatial Economics, 2015, Vol 15, Issue 3, p635

1566-113X

Academic Journal

10.1007/s11067-014-9249-3