|
|
|
Title: Finding Least Cost Hyperpaths in Multimodal Transit Networks: Methodology, Algorithm, and Large-Scale Application
Accession Number: 01557171
Record Type: Component
Record URL: Availability: Transportation Research Board Business Office 500 Fifth Street, NW Find a library where document is available 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 multimodal 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.
Monograph Title: Monograph Accession #: 01593848
Report/Paper Numbers: 15-3390
Language: English
Authors: Verbas, I ÖmerMahmassani, Hani SPagination: pp 95–105
Publication Date: 2015
ISBN: 9780309369473
Media Type: Print
Features: Figures
(9)
; References
(31)
; Tables
(1)
TRT Terms: Identifier Terms: Uncontrolled Terms: Geographic Terms: Subject Areas: Pedestrians and Bicyclists; Planning and Forecasting; Public Transportation; I72: Traffic and Transport Planning
Files: TRIS, TRB, ATRI
Created Date: Dec 30 2014 1:08PM
More Articles from this Serial Issue:
|
