Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transportation Research Record: Journal of the Transportation Research Board
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
