Immune Clonal MO Algorithm for 0/1 Knapsack Problems
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.
KeywordsPareto Front Multiobjective Optimization Knapsack Problem Artificial Immune System Multiobjective Evolutionary Algorithm
Unable to display preview. Download preview PDF.
- 1.Schaffer, J.D.: Multiple objective optimization with vector ecaluated genetic algorithms. PhD thesis, Vanderbilt University (1984)Google Scholar
- 2.Abido, M.A.: Environmental economic power dispatch using multiobjective evolutionary algorithms. IEEE Trans. Power Systems 18(4) (November 2003)Google Scholar
- 4.Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Trans. Evolutionary Computation 3(4) (November 1999)Google Scholar
- 5.Zitzler, E., Laumanns, M., Thiele. L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland (2001) Google Scholar
- 6.Jiao, L.C., Du, H.F.: Artificial immune system: progress and prospect (in Chinese). Acta Electronica Sinica 31(10), 1540–1548 (2003)Google Scholar
- 8.Shang, R.H., Jiao, L.C., Gong, M.G., Lu, B.: Clonal Selection Algorithm for Dynamic Multiobjective Optimization. In: Hao, Y., Liu, J., Wang, Y.-P., Cheung, Y.-m., Yin, H., Jiao, L., Ma, J., Jiao, Y.-C. (eds.) CIS 2005. LNCS (LNAI), vol. 3801, pp. 846–851. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 9.Jiao, L.C., Wang, L.: A novel genetic algorithm based on immunity. IEEE Transactions on Systems, Man and Cybernetics, Part A 30(5) (September 2000)Google Scholar
- 11.Coello, Coello, C.A., Nareli, C.C.: An Approach to Solve Multiobjective Optimization Problems Based on an Artificial Immune System. In: Timmis, J., Bentley, P.J. (eds.) Proceedings of the First International Conference on Artificial Immune Systems, pp. 212–221 (2002)Google Scholar
- 12.Xue, F., Sanderson, A.C., Graves, R.J.: Pareto-based multi-objective differential evolution. In: Proceedings of the 2003 Congress on Evolutionary Computation (CEC 2003), Canberra, Australia, vol. 2, pp. 862–869. IEEE Press, Los Alamitos (2003)Google Scholar
- 13.Zitzler, E.: Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. A dissertation submitted to the Swiss Federal Institute of Technology Zurich for the degree of Doctor of Technical Sciences. Diss. Eth No. 13398 (1999)Google Scholar