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.
Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network
Transportation Research Record: Journal of the Transportation Research Board
Transportation Research Record: Journal of the Transportation Research Board ; 2672 , 47 ; 219-230
10.10.2018
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Time-Dependent Intermodal Minimum-Cost Path Algorithm
British Library Conference Proceedings | 2005
|Freight Traffic Assignment Methodology for Large-Scale Road–Rail Intermodal Networks
Transportation Research Record | 2015
|Intermodal Path Algorithm for Time-Dependent Auto Network and Scheduled Transit Service
Transportation Research Record | 2012
|Intermodal Path Algorithm for Time-Dependent Auto Network and Scheduled Transit Service
Online Contents | 2012
|Network Design for Shipping Service of Large-Scale Intermodal Liners
Online Contents | 2012
|