This paper develops a simple, robust framework for the problem of finding the route with the least expected travel time from any node to any given destination in a stochastic and time-dependent network. Spatial and temporal link travel time correlations are both considered in the proposed solution, which is based on a dynamic programming approach. In particular, the spatial correlation is represented by a Markovian property of the link states, in which each link is assumed to experience congested or uncongested conditions. The temporal correlation is manifested through the time-dependent expected link travel time given the condition of the link traversed. The framework enables the use of a route guidance system, in which at any decision node within a network, a decision can be made on the basis of current traffic information about which node to take next to achieve the shortest expected travel time to the destination. Numerical examples are presented to illustrate the computational steps involved in the framework to make route choices and to demonstrate the effectiveness of the proposed solution.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Shortest Paths in Stochastic Time-Dependent Networks with Link Travel Time Correlation


    Weitere Titelangaben:

    Transportation Research Record: Journal of the Transportation Research Board


    Beteiligte:
    Dong, Wei (Autor:in) / Vu, Hai L. (Autor:in) / Nazarathy, Yoni (Autor:in) / Vo, Bao Quoc (Autor:in) / Li, Minyi (Autor:in) / Hoogendoorn, Serge Paul (Autor:in)


    Erscheinungsdatum :

    01.01.2013




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Deviation between Actual and Shortest Travel Time Paths for Commuters

    Tang, Wenyun / Levinson, David M. | ASCE | 2018



    Shortest Paths in Randomly Time Varying Networks

    Cerulli, R. / Festa, P. / Raiconi, G. et al. | British Library Conference Proceedings | 2001