This chapter discusses rollout algorithms, a sequential approach to optimization problems, whereby the optimization variables are optimized one after the other. A rollout algorithm starts from some given heuristic and constructs another heuristic with better performance than the original. The method is particularly simple to implement and is often surprisingly effective. This chapter explains the method and its properties for discrete deterministic optimization problems.
|Original language||English (US)|
|Title of host publication||Handbook of Combinatorial Optimization|
|Publisher||Springer New York|
|Number of pages||25|
|State||Published - Jan 1 2013|
ASJC Scopus subject areas