Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits

Authors:
Justin C. Goodson;Jeffrey W. Ohlmann;Barrett W. Thomas
Affiliations:
Department of Operations and Information Technology Management, John Cook School of Business, Saint Louis University, St. Louis, Missouri 63108;Department of Management Sciences, Tippie College of Business, University of Iowa, Iowa City, Iowa 52242;Department of Management Sciences, Tippie College of Business, University of Iowa, Iowa City, Iowa 52242
Venue:
Operations Research
Year:
2013

Citing 21
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands

Computers and Operations Research - Neural networks in business
The vehicle routing problem

The vehicle routing problem
Dynamic Programming and Optimal Control

Dynamic Programming and Optimal Control
Rollout Algorithms for Combinatorial Optimization

Journal of Heuristics
Stochastic Vehicle Routing Problem with Restocking

Transportation Science
A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands

Operations Research
An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands

Operations Research
A cooperative parallel rollout algorithm for the sequential ordering problem

Parallel Computing - Special issue: Parallel computing in logistics
Analysis of a Rollout Approach to Sequencing Problems with Stochastic Routing Applications

Journal of Heuristics
An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems

Management Science
Revenue Management in a Dynamic Network Environment

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

Transportation Science
A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems

Networks
Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics)

Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics)
A Paired-Vehicle Recourse Strategy for the Vehicle-Routing Problem with Stochastic Demands

Transportation Science
Routing for Relief Efforts

Transportation Science
Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands

Operations Research
Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints

Networks - Route 2007
Information Relaxations and Duality in Stochastic Dynamic Programs

Operations Research
ASAP: The After-Salesman Problem

Manufacturing & Service Operations Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a family of rollout policies based on fixed routes to obtain dynamic solutions to the vehicle routing problem with stochastic demand and duration limits VRPSDL. In addition to a traditional one-step rollout policy, we leverage the notions of the pre-and post-decision state to distinguish two additional rollout variants. We tailor our rollout policies by developing a dynamic decomposition scheme that achieves high quality solutions to large problem instances with reasonable computational effort. Computational experiments demonstrate that our rollout policies improve upon the performance of a rolling horizon procedure and commonly employed fixed-route policies, with improvement over the latter being more substantial.