Rollout Algorithms for Combinatorial Optimization
Rent the article at a discountRent 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.
- Barto, A.G., Bradtke, S.J., Singh, S.P. (1995) Learning to Act Using Real-Time Dynamic Programming. Artificial Intelligence 72: pp. 81-138 CrossRef
- Barto, A.S. and R. Sutton. (1997). Reinforcement Learning. MIT Press (forthcoming).
- Bertsekas, D.P., Tsitsiklis, J.N. (1996) Neuro-Dynamic Programming. Athena Scientific, Belmont, MA
- Glover, F., Taillard, E., deWerra, D. (1993) A User's Guide to Tabu Search. Annals of Operations Research 41: pp. 3-28 CrossRef
- Pattipati, K.R., Alexandridis, M.G. (1990) Application of Heuristic Search and Information Theory to Sequential Fault Diagnosis. IEEE Transactions on Systems, Man, and Cybernetics 20: pp. 872-887 CrossRef
- Tesauro, G. and G.R. Galperin. (1996). "On-Line Policy Improvement Using Monte Carlo Search." Unpublished report.
- Rollout Algorithms for Combinatorial Optimization
Journal of Heuristics
Volume 3, Issue 3 , pp 245-262
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Industry Sectors