The best routing policy problem in stochastic and time-dependent networks is the subject of this study. This problem can be viewed as a counterpart of the shortest-path problem in deterministic networks. A stochastic time-dependent network is one in which the link travel times are random variables with time-dependent distributions. A routing policy is a decision rule that specifies what node to take next at each decision node on the basis of the realized link travel times and the current time. The framework of the problem is reviewed, on which basis one of the variants of the problem that are pertinent to the traffic context is studied. An exact algorithm to this variant is given, and its complexity is analyzed. Since the running time of the exact algorithm is generally exponential in the number of arcs, the importance of finding good approximations to the exact algorithm is pointed out. Several approximations are presented, and their effectiveness against the exact algorithm is studied both theoretically and computationally.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Best Routing Policy Problem in Stochastic Time-Dependent Networks


    Weitere Titelangaben:

    Transportation Research Record: Journal of the Transportation Research Board


    Beteiligte:
    Gao, Song (Autor:in) / Chabini, Ismail (Autor:in)


    Erscheinungsdatum :

    01.01.2002




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Best Routing Policy Problem in Stochastic Time-Dependent Networks

    Gao, S. / Chabini, I. / Transportation Research Board | British Library Conference Proceedings | 2002



    Routing Policy Choice Set Generation in Stochastic Time-Dependent Networks

    Ding, Jing / Gao, Song / Jenelius, Erik et al. | Transportation Research Record | 2014