Genetic algorithm with schema replaced for solving 0/1 knapsack problem
一种基于模式替代的遗传算法解0/1背包问题

Knapsack problem is a typical NP complete problem.This paper raised genetic algorithm with schema replaced for solving 0/1 knapsack problem.It leaded the search direction of the population to a schema by collecting the best several individuals in population.So,improved the searching efficiency and ability.At last,gave the simulation experiment,and the answer of the knapsack problem which was solved by simple genetic algorithm,compared greedy algorithm and genetic algorithm with schema replaced.By this compa...