关键词: 0/1背包问题, 自适应遗传算法, 交叉变异概率, 交叉变异操作, 模式替代操作

Abstract: 0/1 Knapsack Problems is a typical optimization problem in Operations Research, Genetic Algorithms is one of the most commonly evolutionary algorithms used to solve the problems. This paper proposed an improved adaptive genetic algorithm. In this algorithm, we introduce the evolution number into the crossover probability and mutation probability formula、improve the crossover operator and mutation operator, and add a pattern replacement operation. The simulation results show that, the solution speed and the optimal solution have greatly improved with our algorithms.

Key words: 0/1 knapsack problems, adaptive genetic algorithms, crossover and mutation probability, crossover and mutation operator, pattern replacement operation