A new method for solving 0/1 knapsack problem based on evolutionary algorithm with schema replaced
Kangshun Li, Yuzhen Jia, Wensheng Zhang, Yang Ming Xie · 2008
Knapsack problem is a typical NP complete problem. Knapsack problem correspondent mathematical model is proposed in this paper, and the evolutionary algorithm with schema replaced is raised. In this a1gorithm, it leads the search direction of the population by collecting the best several individuals to a schema. Because of that, the searching efficiency is improved. At last, the simulation experiment is given and the answer of the knapsack problem which is solved by simple evolutionary algorithm and the evolutionary algorithm with schema replaced two is compared. By this comparison, the advantage which use schema replaced to solve knapsack problem is proved.