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.
Using stochastic-dominance relationships for bounding travel times in stochastic networks
1999-01-01
681336 byte
Conference paper
Electronic Resource
English
Using Stochastic-Dominance Relationships for Bounding Travel Times in Stochastic Networks
British Library Conference Proceedings | 1999
|Stochastic Vehicle Routing with Random Travel Times
British Library Online Contents | 2003
|Stochastic Vehicle Routing with Random Travel Times
Online Contents | 2003
|Estimation of time‐dependent, stochastic route travel times using artificial neural networks
Taylor & Francis Verlag | 2000
|ESTIMATION OF TIME-DEPENDENT, STOCHASTIC ROUTE TRAVEL TIMES USING ARTIFICIAL NEURAL NETWORKS
Online Contents | 2000
|