A New Immune Genetic Algorithm for 0-1 Knapsack Problem

Author

Zongxin Jin ; Hongjuan Fan

Author_Institution

Dept. of Inf. Eng., Huanghe Sci. & Technol. Coll., Zhengzhou, China

Volume

1

fYear

2013

fDate

28-29 Oct. 2013

Firstpage

31

Lastpage

33

Abstract

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.

Keywords

genetic algorithms; knapsack problems; 0-1 knapsack problem; NIGA; antigen characteristics; iterative optimization; new immune genetic algorithm; optimization process; vaccine immune system; Convergence; Genetic algorithms; Immune system; Libraries; Sociology; Statistics; Vaccines; 0-1 Knapsack problem; artificial immune; genetic algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Design (ISCID), 2013 Sixth International Symposium on

Conference_Location

Hangzhou

Type

conf

DOI

10.1109/ISCID.2013.15

Filename

6804779