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.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Weitere Titelangaben:

    Transportation Research Record: Journal of the Transportation Research Board


    Beteiligte:
    Verbas, Ömer (Autor:in) / Auld, Joshua (Autor:in) / Ley, Hubert (Autor:in) / Weimer, Randy (Autor:in) / Driscoll, Shon (Autor:in)


    Erscheinungsdatum :

    10.10.2018




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Time-Dependent Intermodal Minimum-Cost Path Algorithm

    National Research Council (U.S.) | British Library Conference Proceedings | 2005


    Freight Traffic Assignment Methodology for Large-Scale Road–Rail Intermodal Networks

    Uddin, M. Majbah / Huynh, Nathan | Transportation Research Record | 2015


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

    Khani, Alireza / Lee, Sanggu / Hickman, Mark et al. | Transportation Research Record | 2012