1 INTRODUCTION
Most real-world optimization problems are dynamic because the objective function, environmental parameter and/or constraint conditions maybe change over time. The dynamic knapsack problems are a class of well known problems, which can bridge the gap between the very complex, hard to understand real-world problems and the too simple toy problems because many real problems can be described by the dynamic knapsack problems.