Skip to main content

Immune Clonal MO Algorithm for 0/1 Knapsack Problems

  • Conference paper
Advances in Natural Computation (ICNC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4221))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  3. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6, 182–197 (2002)

    Article  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 

  7. Jiao, L.C., Gong, M.G., Shang, R.H., Du, H.F., Lu, B.: Clonal Selection with Immune Dominance and Anergy Based Multiobjective Optimization. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 474–489. Springer, Heidelberg (2005)

    Chapter  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)

    Chapter  Google 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 

  10. de Castro, L.N., Von Zuben, F.J.: Learning and Optimization Using the Clonal Selection Principle. IEEE Transactions on Evolutionary Computation 6(3), 239–251 (2002)

    Article  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shang, R., Ma, W., Zhang, W. (2006). Immune Clonal MO Algorithm for 0/1 Knapsack Problems. In: Jiao, L., Wang, L., Gao, Xb., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881070_115

Download citation

  • DOI: https://doi.org/10.1007/11881070_115

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45901-9

  • Online ISBN: 978-3-540-45902-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics