A new algorithm for multi-objective 0/1 knapsack problems is proposed. The antibodies in the antibody population are divided into dominated ones and non-dominated ones
which solves the diversity problem in the multi-objective optimization problems. In the algorithm
the clonal operation is adopted to implement the searching for optimal solutions in the global region and getting a widely spread Pareto-front. Then
adopting the immune gene operation the searching for optimal solutions is improved in the local region. In the last
the antibody repair operator is introduced for repairing the infeasible solutions produced by the immune gene operation
which guarantees the antibodies in the feasible region and implements the local research. Compared with the existed algorithms
the algorithm can obtain high quality solutions with good diversity
uniformity and convergence. Simulation results show that the Pareto-front obtained by the new algorithm has the most widely spread; the solutions obtained by the algorithm can converge to the Pareto-front and the spacing metric is depressed under 1%.
关键词
Keywords
references
ZITZLER E, THIELE L. Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach [J]. IEEE Trans Evol Computer,1999,3(4):257-271.
SCHAFFER J D. Multiple objective optimization with vector evaluated genetic algorithms [D]. Nashville, USA: Vanderbilt University,1984.
HORN J, NAFPLIOTIS N. Multiobjective optimization using the niched pareto genetic algorithm, IlliGAL Report 93005 [R]. Urbana, USA: Illinois Genetic Algorithms Laboratory, University of Illinois, 1993.
NAND S, DEB K. Multiobjective optimization using nondominated sorting in genetic algorithms [J]. IEEE Trans Evol Computer,1994, 2(3): 221-248.
de CASTRO L N, von ZUBEN F J. Learning and optimization using the clonal selection principle [J]. IEEE Trans Evol Computer, 2002, 6(3):239-251.
焦李成,杜海峰,刘芳,等.免疫优化计算、学习与识别[M].北京:科学出版社, 2006.
ISHIBUCHI H, MURATA T. A multiobjective genetic local search algorithm and its application to flowshop scheduling [J]. IEEE Trans System, Man and Cyber,1998, 28(3): 392-403.
潘正君,康立山,陈毓屏.演化计算[M].北京:清华大学出版社,1998.
郑金华.多目标进化算法及其应用[M].北京:科学出版社,2007.
ZITZLER E, DEB K, THIELE L. Comparison of multiobjective evolutionary algorithms: empirical results [J]. IEEE Trans Evol Computer, 2000, 8(2):173-195.