Finding Least Cost Hyperpaths in Multimodal Transit Networks
Finding Least Cost Hyperpaths in Multimodal Transit Networks
Methodology, Algorithm, and Large-Scale Application
- New search for: Verbas, İ. Ömer
- New search for: Mahmassani, Hani S.
- New search for: Verbas, İ. Ömer
- New search for: Mahmassani, Hani S.
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.
Document information
Finding Least Cost Hyperpaths in Multimodal Transit Networks
Methodology, Algorithm, and Large-Scale Application
Transportation Research Record
Transportation Research Record: Journal of the Transportation Research Board ; 2497 , 1 ; 95-105
2019-04-04
Article (Journal)
Electronic Resource
English
Similar titles
Finding Least Cost Hyperpaths in Multimodal Transit Networks
| Online Contents | 2015
Least Expected Time Hyperpaths in Stochastic, Time-Varying Multimodal Networks
| Transportation Research Record | 2001
Least Expected Time Hyperpaths in Stochastic, Time-Varying Multimodal Networks
| British Library Conference Proceedings | 2001
Least Expected Time Hyperpaths in Stochastic, Time-Varying Multimodal Networks
| Online Contents | 2001
Generation and calibration of transit hyperpaths
| Elsevier | 2013