Average-Case Performance of Rollout Algorithms for Knapsack Problems
Author(s)Mastin, Andrew; Jaillet, Patrick
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
MetadataShow full item record
Rollout algorithms have demonstrated excellent performance on a variety of dynamic and discrete optimization problems. Interpreted as an approximate dynamic programming algorithm, a rollout algorithm estimates the value-to-go at each decision stage by simulating future events while following a heuristic policy, referred to as the base policy. While in many cases rollout algorithms are guaranteed to perform as well as their base policies, there have been few theoretical results showing additional improvement in performance. In this paper, we perform a probabilistic analysis of the subset sum problem and 0–1 knapsack problem, giving theoretical evidence that rollout algorithms perform strictly better than their base policies. Using a stochastic model from the existing literature, we analyze two rollout methods that we refer to as the exhaustive rollout and consecutive rollout, both of which employ a simple greedy base policy. We prove that both methods yield a significant improvement in expected performance after a single iteration of the rollout algorithm, relative to the base policy.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Journal of Optimization Theory and Applications
Mastin, Andrew, and Patrick Jaillet. “Average-Case Performance of Rollout Algorithms for Knapsack Problems.” Journal of Optimization Theory and Applications 165, no. 3 (July 26, 2014): 964–984.
Author's final manuscript