Intermodal Path Algorithm for Time-Dependent Auto Network and Scheduled Transit Service

Khani, Alireza, Lee, Sanggu, Hickman, Mark, Noh, Hyunsoo and Nassir, Neema (2012) Intermodal Path Algorithm for Time-Dependent Auto Network and Scheduled Transit Service. Transportation Research Record, 2284: 40-46. doi:10.3141/2284-05

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
UQ309883_OA.pdf Full text (open access) application/pdf 1.19MB 0

Author Khani, Alireza
Lee, Sanggu
Hickman, Mark
Noh, Hyunsoo
Nassir, Neema
Title Intermodal Path Algorithm for Time-Dependent Auto Network and Scheduled Transit Service
Journal name Transportation Research Record   Check publisher's open access policy
ISSN 0361-1981
Publication date 2012-01
Year available 2012
Sub-type Article (original research)
DOI 10.3141/2284-05
Open Access Status File (Publisher version)
Issue 2284
Start page 40
End page 46
Total pages 7
Place of publication Washington, DC United States
Publisher U.S. National Research Council
Collection year 2012
Language eng
Formatted abstract
 A simple but efficient algorithm is proposed for finding the optimal path in an intermodal urban transportation network. The network is a general transportation network with multiple modes (auto, bus, rail, walk, etc.) divided into the two major categories of private and public, with proper transfer constraints. The goal was to find the optimal path according to the generalized cost, including private-side travel cost, public-side travel cost, and transfer cost. A detailed network model of transfers between modes was used to improve the accounting of travel times during these transfers. The intermodal path algorithm was a sequential application of specific cases of transit and auto shortest paths and resulted in the optimal intermodal path, with the optimal park-and-ride location for transferring from private to public modes. The computational complexity of the algorithm was shown to be a significant improvement over existing algorithms. The algorithm was applied to a real network within a dynamic traffic and transit assignment procedure and integrated with a sequential activity choice model.
Keyword Multimodal Networks
Combined Modes
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status Non-UQ

Document type: Journal Article
Sub-type: Article (original research)
Collection: School of Civil Engineering Publications
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 9 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 13 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Fri, 20 Sep 2013, 14:08:04 EST by System User on behalf of School of Civil Engineering