Stochastic Vehicle Routing with Random Travel Times

Authors:
Astrid S. Kenyon;David P. Morton
Affiliations:
-;-
Venue:
Transportation Science
Year:
2003

Citing 0
Cited 8

The "BEST" algorithm for solving stochastic mixed integer programs

Proceedings of the 38th conference on Winter simulation
Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic

Transportation Science
Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic

Transportation Science
Empirical Analysis of Ambulance Travel Times: The Case of Calgary Emergency Medical Services

Management Science
Time Slot Management in Attended Home Delivery

Transportation Science
Vehicle routing problem with stochastic travel times including soft time windows and service costs

Computers and Operations Research
Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands

Applied Soft Computing
Logistical support scheduling under stochastic travel times given an emergency repair work schedule

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

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.