In this paper, two computationally efficient algorithms are presented for determining the least possible time paths for all origins to a single destination in networks where the arc weights are discrete random variables whose probability distribution functions vary with time. The first algorithm determines the least possible time path from each node for each departure time interval, the least possible travel time and a lower bound on the associated probability of the occurrence of this travel time. The second algorithm determines up to k least possible time paths, the associated travel times and the corresponding probabilities of occurrence of the travel times (or a lower bound on this probability). No such efficient algorithms for determining least time paths in stochastic, time-varying networks exist in the literature. © 1998 Elsevier Science Ltd. All rights reserved.
https://doi.org/10.1016/S0305-0548(98)00027-6Cite as:
@article{Miller_Hooks_1998,
doi = {10.1016/s0305-0548(98)00027-6},
url = {https://doi.org/10.1016%2Fs0305-0548%2898%2900027-6},
year = 1998,
month = {dec},
publisher = {Elsevier {BV}},
volume = {25},
number = {12},
pages = {1107--1125},
author = {Elise D. Miller-Hooks and Hani S. Mahmassani},
title = {Least possible time paths in stochastic,time-varying networks},
journal = {Computers {&}amp$mathsemicolon$ Operations Research}
}