TY - JOUR

T1 - Least expected time paths in stochastic, time-varying transportation networks

AU - Miller-Hooks, Elise D.

AU - Mahmassani, Hani S.

PY - 2000/5

Y1 - 2000/5

N2 - We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random arc weight to its expected value and solving an equivalent deterministic problem. This paper addresses the problem of determining least expected time paths in stochastic, time-varying networks. Two procedures are presented. The first procedure determines the a priori least expected time paths from all origins to a single destination for each departure time in the peak period. The second procedure determines lower bounds on the expected times of these a priori least expected time paths. This procedure determines an exact solution for the problem where the driver is permitted to react to revealed travel times on traveled links en route, i.e., in a time-adaptive route choice framework. Modifications to each of these procedures for determining least expected cost (where cost is not necessarily travel time) paths and lower bounds on the expected costs of these paths are given. Extensive numerical tests are conducted to illustrate the algorithms' computational performance as well as the properties of the solution.

AB - We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random arc weight to its expected value and solving an equivalent deterministic problem. This paper addresses the problem of determining least expected time paths in stochastic, time-varying networks. Two procedures are presented. The first procedure determines the a priori least expected time paths from all origins to a single destination for each departure time in the peak period. The second procedure determines lower bounds on the expected times of these a priori least expected time paths. This procedure determines an exact solution for the problem where the driver is permitted to react to revealed travel times on traveled links en route, i.e., in a time-adaptive route choice framework. Modifications to each of these procedures for determining least expected cost (where cost is not necessarily travel time) paths and lower bounds on the expected costs of these paths are given. Extensive numerical tests are conducted to illustrate the algorithms' computational performance as well as the properties of the solution.

UR - http://www.scopus.com/inward/record.url?scp=0034187603&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034187603&partnerID=8YFLogxK

U2 - 10.1287/trsc.34.2.198.12304

DO - 10.1287/trsc.34.2.198.12304

M3 - Article

AN - SCOPUS:0034187603

SN - 0041-1655

VL - 34

SP - 198

EP - 215

JO - Transportation Science

JF - Transportation Science

IS - 2

ER -