关键词: 致死染色体, 免疫算子, 约束组合优化问题, 遗传算法

Abstract: Lethal chromosomes unsatisfied with constraints may come into being in GA for constrained combinatorial optimization problems. If its number is too large in a pool, the GA’s implementing and searching performance will degrade. This paper proposed a method to revive lethal chromosome based immune operator. The main process is that, constructing a vaccine according to the characteristic information of problem to be solved, excellent chromosome and the lethal chromosome, and then vaccinating and immune selecting, after that, immigrating lethal chromosomes and revived chromosomes between two islands. Applying the method to 0-1 knapsack problem, the numerical results show that the proposed method can effectively improve the performance of GA.

Key words: lethal chromosome, immune operator, constrained optimization problem, genetic algorithm