skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network

Abstract

This paper proposes a time-dependent intermodal A* (TDIMA*) algorithm. The algorithm works on a multimodal network with transit, walking, and vehicular network links, and finds paths for the three major modes (transit, walking, driving) and any feasible combination thereof (e.g., park-and-ride). Turn penalties on the vehicular network and progressive transfer penalties on the transit network are considered for improved realism. Moreover, upper bounds to prevent excessive waiting and walking are introduced, as well as an upper bound on driving for the park-and-ride (PNR) mode. The algorithm is validated on the large-scale Chicago Regional network using real-world trips against the Google Directions API and the Regional Transit Authority router.

Authors:
; ; ; ;
Publication Date:
Research Org.:
Argonne National Lab. (ANL), Argonne, IL (United States)
Sponsoring Org.:
U.S. Department of Transportation - Federal Transit Administration
OSTI Identifier:
1493589
DOE Contract Number:  
AC02-06CH11357
Resource Type:
Conference
Resource Relation:
Conference: 97th Annual Meeting of the Transportation Research Board, 01/07/18 - 01/11/18, Washington, DC, US
Country of Publication:
United States
Language:
English

Citation Formats

Verbas, Omer, Auld, Joshua, Ley, Hubert, Weimer, Randy, and Driscoll, Shon. A Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network. United States: N. p., 2018. Web. doi:10.1177/0361198118796402.
Verbas, Omer, Auld, Joshua, Ley, Hubert, Weimer, Randy, & Driscoll, Shon. A Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network. United States. doi:10.1177/0361198118796402.
Verbas, Omer, Auld, Joshua, Ley, Hubert, Weimer, Randy, and Driscoll, Shon. Thu . "A Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network". United States. doi:10.1177/0361198118796402.
@article{osti_1493589,
title = {A Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network},
author = {Verbas, Omer and Auld, Joshua and Ley, Hubert and Weimer, Randy and Driscoll, Shon},
abstractNote = {This paper proposes a time-dependent intermodal A* (TDIMA*) algorithm. The algorithm works on a multimodal network with transit, walking, and vehicular network links, and finds paths for the three major modes (transit, walking, driving) and any feasible combination thereof (e.g., park-and-ride). Turn penalties on the vehicular network and progressive transfer penalties on the transit network are considered for improved realism. Moreover, upper bounds to prevent excessive waiting and walking are introduced, as well as an upper bound on driving for the park-and-ride (PNR) mode. The algorithm is validated on the large-scale Chicago Regional network using real-world trips against the Google Directions API and the Regional Transit Authority router.},
doi = {10.1177/0361198118796402},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2018},
month = {10}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: