Skip to main content
Log in

Asymptotic convergence of metaheuristics for multiobjective optimization problems

  • ORIGINAL PAPER
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This paper analyzes the convergence of metaheuristics used for multiobjective optimization problems in which the transition probabilities use a uniform mutation rule. We prove that these algorithms converge only if elitism is used.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. 1. Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3):268–308

    Article  Google Scholar 

  2. 2. Coello CAC, van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer, New York, ISBN 0-3064-6762-3

    MATH  Google Scholar 

  3. 3. Dasgupta D (ed) (1999) Artificial immune systems and their applications. Springer Berlin Heidelberg, NewYork

    MATH  Google Scholar 

  4. 4. Doob JL (1953) Stochastic processes.Wiley, NewYork

    MATH  Google Scholar 

  5. 5. Fogel LJ (1966) intelligence through simulated evolution. JohnWiley, NewYork

    MATH  Google Scholar 

  6. 6. Fogel LJ (1999) Artificial intelligence through simulated evolution. Forty years of evolutionary programming. JohnWiley, NewYork

    Google Scholar 

  7. 7. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading

    MATH  Google Scholar 

  8. 8. de Castro LN,Timmis J (2002) An introduction to artificial immune systems: a newcomputational intelligence paradigm. Springer, UK

    Google Scholar 

  9. 9. Rudolph G (1994) Convergence analysis of canonical genetic algorithms. IEEE Trans Neural Netw 5:96–101

    Article  Google Scholar 

  10. Rudolph G, Agapie A (2000) Convergence properties of some multi-objective evolutionary algorithms. In: Proceedings of the 2000 conference on evolutionary computation, vol 2, pp 1010–1016. IEEE Press, Piscataway.

  11. 11. Schwefel H-P (1995) Evolution and optimum seeking. JohnWiley, NewYork

    Google Scholar 

  12. 12. Seneta E (1981) Non-negative matrices and Markov chains. Springer Berlin Heidelberg, NewYork

    MATH  Google Scholar 

  13. 13. SpearsWM (2000) Evolutionary algorithms. The role of mutation and recombination. Springer Berlin Heidelberg, New York. ISBN 3-540-66950-7

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mario Villalobos-Arias.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Villalobos-Arias, M., Coello Coello, C.A. & Hernández-Lerma, O. Asymptotic convergence of metaheuristics for multiobjective optimization problems. Soft Comput 10, 1001–1005 (2006). https://doi.org/10.1007/s00500-005-0027-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-005-0027-5

Keywords

Navigation