## Abstract

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.

Original language | English (US) |
---|---|

Pages (from-to) | 1107-1125 |

Number of pages | 19 |

Journal | Computers and Operations Research |

Volume | 25 |

Issue number | 12 |

DOIs | |

State | Published - Dec 1998 |

## Keywords

- Shortest paths
- Stochastic dynamic networks

## ASJC Scopus subject areas

- General Computer Science
- Modeling and Simulation
- Management Science and Operations Research