Stochastic Vehicle Routing with Random Travel Times
- 1 February 2003
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 37 (1), 69-82
- https://doi.org/10.1287/trsc.37.1.69.12820
Abstract
We consider stochastic vehicle routing problems on a network with random travel and service times. A fleet of one or more vehicles is available to be routed through the network to service each node. Two versions of the model are developed based on alternative objective functions. We provide bounds on optimal objective function values and conditions under which reductions to simpler models can be made. Our solution method embeds a branch-and-cut scheme within a Monte Carlo sampling-based procedure.Keywords
This publication has 37 references indexed in Scilit:
- Further results on the probabilistic traveling salesman problemEuropean Journal of Operational Research, 1993
- A Vehicle Routing Problem with Stochastic DemandOperations Research, 1992
- The stochastic vehicle routing problem revisitedEuropean Journal of Operational Research, 1992
- A Priori OptimizationOperations Research, 1990
- Generalized Dynamic Programming for Stochastic Combinatorial OptimizationOperations Research, 1989
- The Traveling Salesman Location Problem on Stochastic NetworksTransportation Science, 1989
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- The value of the stochastic solution in stochastic linear programs with fixed recourseMathematical Programming, 1982
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954