We consider stochastic networks in which link travel times are dependent, discrete random variables. We present methods for computing bounds on path travel times using stochastic dominance relationships among link travel times, and discuss techniques for controlling tightness of the bounds. We apply these methods to shortest-path problems, show that the proposed algorithm can provide bounds on the recommended path, and elaborate on extensions of the algorithm for demonstrating the anytime property.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Using stochastic-dominance relationships for bounding travel times in stochastic networks


    Beteiligte:
    Chao-Lin Liu (Autor:in) / Wellman, M.P. (Autor:in)


    Erscheinungsdatum :

    01.01.1999


    Format / Umfang :

    681336 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Using Stochastic-Dominance Relationships for Bounding Travel Times in Stochastic Networks

    Liu, C. L. / Wellman, M. P. / IEEE et al. | British Library Conference Proceedings | 1999


    Stochastic Vehicle Routing with Random Travel Times

    Kenyon, A. S. / Morton, D. P. | British Library Online Contents | 2003



    Stochastic Vehicle Routing with Random Travel Times

    Kenyon, Astrid S. | Online Contents | 2003