Travel times in congested transportation networks are time-varying quantities that can at best be known a priori probabilistically. In such networks, the arc weights (travel times) are represented by random variables whose probability distribution functions vary with time. These networks are referred to herein as stochastic, time-varying, or STV, networks. The determination of “least time” routes in STV networks is more difficult than in deterministic networks, in part because, for a given departure time, more than one path may exist between an origin and destination, each with a positive probability of having the least travel time. In this paper, measures for comparing time-varying, random path travel times over a time period are given for both a priori optimization and time-adaptive choices (where a driver may react to revealed arrival times at intermediate nodes). The resulting measures are central to the development of methodologies for determining “optimal” paths in STV networks. © 2002 Elsevier Science B.V. All rights reserved.
https://doi.org/10.1016/S0377-2217(02)00231-XCite as:
@article{Miller_Hooks_2003,
doi = {10.1016/s0377-2217(02)00231-x},
url = {https://doi.org/10.1016%2Fs0377-2217%2802%2900231-x},
year = 2003,
month = {apr},
publisher = {Elsevier {BV}},
volume = {146},
number = {1},
pages = {67--82},
author = {Elise Miller-Hooks and Hani Mahmassani},
title = {Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks},
journal = {European Journal of Operational Research}
}