Finding least cost hyperpaths in multimodal transit networks methodology, algorithm, and large-scale application

I. Ömer Verbas, Hani S Mahmassani*

*Corresponding author for this work

Research output: Contribution to journalArticle

7 Scopus citations

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 modespecific 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.

Original languageEnglish (US)
Pages (from-to)95-105
Number of pages11
JournalTransportation Research Record
Volume2497
DOIs
StatePublished - Jan 1 2015

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Mechanical Engineering

Fingerprint Dive into the research topics of 'Finding least cost hyperpaths in multimodal transit networks methodology, algorithm, and large-scale application'. Together they form a unique fingerprint.

  • Cite this