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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dynamic route search of the shortest mean travel time


    Additional title:

    Dynamische Fahrtroutenbestimmung


    Contributors:
    Shimizu, H. (author) / Kobayashi, M. (author) / Yonezawa, Y. (author)


    Publication date :

    1998


    Size :

    6 Seiten, 13 Bilder, 2 Tabellen, 2 Quellen



    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    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 | European Patent Office | 2022

    Free access


    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