, Volume 3, Issue 3, pp 245-262

Rollout Algorithms for Combinatorial Optimization

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


We consider the approximate solution of discrete optimization problems using procedures that are capable of magnifying the effectiveness of any given heuristic algorithm through sequential application. In particular, we embed the problem within a dynamic programming framework, and we introduce several types of rollout algorithms, which are related to notions of policy iteration. We provide conditions guaranteeing that the rollout algorithm improves the performance of the original heuristic algorithm. The method is illustrated in the context of a machine maintenance and repair problem.