Immune clonal MO algorithm for 0/1 knapsack problems

Authors:
Ronghua Shang;Wenping Ma;Wei Zhang
Affiliations:
Institute of Intelligent Information Processing, Xidian University, Xi'an, P.R. China;Institute of Intelligent Information Processing, Xidian University, Xi'an, P.R. China;Institute of Intelligent Information Processing, Xidian University, Xi'an, P.R. China
Venue:
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
Year:
2006

Citing 6
Cited 0

Clonal selection algorithm for dynamic multiobjective optimization

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Clonal selection with immune dominance and anergy based multiobjective optimization

EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach

IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
Learning and optimization using the clonal selection principle

IEEE Transactions on Evolutionary Computation
A novel genetic algorithm based on immunity

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a new multiobjective optimization (MO) algorithm to solve 0/1 knapsack problems using the immune clonal principle. This algorithm is termed Immune Clonal MO Algorithm (ICMOA). In ICMOA, the antibody population is split into the population of the nondominated antibodies and that of the dominated antibodied. Meanwhile, the nondominated antibodies are allowed to survive and to clone. A metric of Coverage of Two Sets is adopted for the problems. This quantitative metric is used for testing the convergence to the Pareto-optimal front. Simulation results on the 0/1 knapsack problems show that ICMOA, in most problems, is able to find much better spread of solutions and better convergence near the true Pareto-optimal front compared with SPEA, NSGA, NPGA and VEGA.