Trip-Based Path Algorithms Using the Transit Network Hierarchy

Alireza Khani (), Mark Hickman and Hyunsoo Noh

Networks and Spatial Economics, 2015, vol. 15, issue 3, 635-653

Abstract: 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. Copyright Springer Science+Business Media New York 2015

Keywords: Public transit modeling; Network hierarchy; Schedule-based transit network; Shortest path; Hyperpath; Transit A* (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://hdl.handle.net/10.1007/s11067-014-9249-3 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kap:netspa:v:15:y:2015:i:3:p:635-653

Ordering information: This journal article can be ordered from
http://www.springer. ... ce/journal/11067/PS2

DOI: 10.1007/s11067-014-9249-3

Access Statistics for this article

Networks and Spatial Economics is currently edited by Terry L. Friesz

More articles in Networks and Spatial Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().