Finding Least Cost Hyperpaths in Multimodal Transit Networks Methodology, Algorithm, and Large-Scale Application

• Published in: Transportation research record Vol. 2497; no. 1; pp. 95 - 105
• Main Authors: Verbas, İ. Ömer, Mahmassani, Hani S.
• Format: Journal Article
• Language: English
• Published: Los Angeles, CA SAGE Publications 01.01.2015
• ISSN: 0361-1981; 2169-4052
• DOI: 10.3141/2497-10

This paper presents a least cost hyperpath algorithm that captures the complexities that arise in a transit network because of the number of transfers, the standing and overcrowding penalties, the availability of walking and biking in addition to the transit modes, and the mode-specific limitations such as availability of bike parking. The problem was formulated as a mathematical program, and then a hybrid label setting–correcting algorithm was proposed as a solution. The multi-modal time- and approach-dependent algorithm does not require spatial or temporal expansion of the network; this feature results in good computational performance for large-scale applications. Scenario runs performed on the large-scale Chicago Transit Authority network, in Illinois, validate the accuracy and performance of the algorithm.