A New Immune Genetic Algorithm for 0-1 Knapsack Problem

The degeneration of genetic algorithm in the late iterative optimization has been one of the main problems in genetic algorithm. The combination of genetic and immunity in biology has been shown to be an effective approach to solving the problems. To reach quickly identify the characteristics of the antigen through the injection of the vaccine´s immune system, traditional genetic algorithm has been improved in this paper. A new immune genetic algorithm (NIGA) is proposed based on this theory for 0-1 Knapsack problem. The experiment implies that the NIGA can improve the convergent speed of the algorithm, prevent the algorithm degenerative effectively during the process of optimization of the genetic algorithm.