Article ID: | iaor19991965 |
Country: | United Kingdom |
Volume: | 25 |
Issue: | 12 |
Start Page Number: | 1107 |
End Page Number: | 1125 |
Publication Date: | Dec 1998 |
Journal: | Computers and Operations Research |
Authors: | Mahmassani Hani S., Miller-Hooks Elise D. |
Keywords: | communications |
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