This paper studies the dynamic route search of traffic networks which play an essential role in dynamic route guidance systems. The mean OD travel time is evaluated by summing up the mean travel time of each link. Two dynamic route search algorithms are presented; one is 'the shortest distance route algorithm', the other is 'the shortest mean travel time route algorithm'. From the simulation results of the two dynamic route seach algorithms, it is confirmed that the mean OD travel time vary remarkably depending on the traffic flow conditions, the signal control parameters and the number of time for the right-turn.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Dynamic route search of the shortest mean travel time


    Weitere Titelangaben:

    Dynamische Fahrtroutenbestimmung


    Beteiligte:
    Shimizu, H. (Autor:in) / Kobayashi, M. (Autor:in) / Yonezawa, Y. (Autor:in)


    Erscheinungsdatum :

    1998


    Format / Umfang :

    6 Seiten, 13 Bilder, 2 Tabellen, 2 Quellen



    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Print


    Sprache :

    Englisch




    Dynamic Route Search of the Shortest Mean Travel Time

    Shimizu, H. / Kobayashi, M. / Yonezawa, Y. et al. | British Library Conference Proceedings | 1998


    TRAVEL ROUTE SEARCH DEVICE, TRAVEL ROUTE SEARCH SYSTEM, AND TRAVEL ROUTE SEARCH METHOD

    KURUMAZAKI HIRONOBU / FURUKUBO SHOTA | Europäisches Patentamt | 2022

    Freier Zugriff


    Dynamic Shortest-Path Algorithm for Continuous Arc Travel Times

    Hu, Jian / Chan, Yupo | Transportation Research Record | 2008


    Shortest-time route finding application using vehicular communication

    Chaqfeh, Moumena / Lakas, Abderrahmane | IEEE | 2014