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

Author

Liu, Chao-Lin ; Wellman, Michael P.

Author_Institution

Dept. of Comput. Sci., Nat. Chengchi Univ., Taipei, Taiwan

fYear

1999

fDate

6/21/1905 12:00:00 AM

Firstpage

55

Lastpage

60

Abstract

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

Keywords

minimisation; probability; stochastic processes; transportation; anytime property; bounding travel times; discrete random variables; link travel times; shortest-path problems; stochastic networks; stochastic-dominance relationships; Chaos; Computer science; Costs; Distributed computing; Intelligent networks; Intelligent transportation systems; Path planning; Probability distribution; Random variables; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Transportation Systems, 1999. Proceedings. 1999 IEEE/IEEJ/JSAI International Conference on

Conference_Location

Tokyo

Print_ISBN

0-7803-4975-X

Type

conf

DOI

10.1109/ITSC.1999.821027

Filename

821027