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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:


    Publication date :

    1999-01-01


    Size :

    681336 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    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