Analysis of a Rollout Approach to Sequencing Problems with Stochastic Routing Applications

Authors:
Nicola Secomandi
Affiliations:
Graduate School of Industrial Administration, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA. ns7@andrew.cmu.edu
Venue:
Journal of Heuristics
Year:
2003

Citing 18
Cited 7

Integer and combinatorial optimization

Integer and combinatorial optimization
A priori optimization

Operations Research
A vehicle routing problem with stochastic demand

Operations Research
Scheduling straight-line code using reinforcement learning and rollouts

Proceedings of the 1998 conference on Advances in neural information processing systems II
Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands

Computers and Operations Research - Neural networks in business
Dynamic Programming and Optimal Control, Two Volume Set

Dynamic Programming and Optimal Control, Two Volume Set
Reinforcement Learning

Reinforcement Learning
Tabu Search

Tabu Search
Neuro-Dynamic Programming

Neuro-Dynamic Programming
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Rollout Algorithms for Combinatorial Optimization

Journal of Heuristics
Rollout Algorithms for Stochastic Scheduling Problems

Journal of Heuristics
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Stochastic Vehicle Routing Problem with Restocking

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

Operations Research
Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands

Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands
An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems

Management Science
Revenue Management in a Dynamic Network Environment

Transportation Science

Approximate Policy Optimization and Adaptive Control in Regression Models

Computational Economics
Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands

Operations Research
A survey on metaheuristics for stochastic combinatorial optimization

Natural Computing: an international journal
Implementation effort and performance: a comparison of custom and out-of-the-box metaheuristics on the vehicle routing problem with stochastic demand

SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
The Vehicle Routing Problem with Stochastic Demand and Duration Constraints

Transportation Science
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands

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

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper considers sequencing problems, the traveling salesman problem being their natural representative. It studies a rollout approach that employs a cyclic heuristic as its main base algorithm. The theoretical analysis establishes that it is guaranteed to improve (at least in a weak sense) the quality of any feasible solution to a given sequencing problem. Besides other applications, the paper shows that it is well suited for applications that are embedded in dynamic and stochastic environments. The computational performance of the approach is investigated with applications to two stochastic routing problems. The dynamic version of the heuristic appears to be the first algorithm available in the literature to approximately solve a variant of one of these problems.