Least possible time paths in stochastic, time-varying networks |
| |
Authors: | Elise D Miller-Hooks Hani S Mahmassani |
| |
Affiliation: | aDepartment of Civil and Environmental Engineering, Box 90287, Duke University, Durham,NC 27708-0287, USA;bThe National Institute of Statistical Sciences, P.O. Box 14006, Research Triangle Park,NC 27709-4006, USA;cECJ 6.2, The University of Texas at Austin, Austin, TX 78712, USA |
| |
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. |
| |
Keywords: | Operations research Random processes Time varying networks Algorithms Probability distributions Functions Stochastic dynamic networks |
本文献已被 ScienceDirect 等数据库收录! |
|