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.
Similar content being viewed by others
References
1. Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3):268–308
2. Coello CAC, van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer, New York, ISBN 0-3064-6762-3
3. Dasgupta D (ed) (1999) Artificial immune systems and their applications. Springer Berlin Heidelberg, NewYork
4. Doob JL (1953) Stochastic processes.Wiley, NewYork
5. Fogel LJ (1966) intelligence through simulated evolution. JohnWiley, NewYork
6. Fogel LJ (1999) Artificial intelligence through simulated evolution. Forty years of evolutionary programming. JohnWiley, NewYork
7. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading
8. de Castro LN,Timmis J (2002) An introduction to artificial immune systems: a newcomputational intelligence paradigm. Springer, UK
9. Rudolph G (1994) Convergence analysis of canonical genetic algorithms. IEEE Trans Neural Netw 5:96–101
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. Schwefel H-P (1995) Evolution and optimum seeking. JohnWiley, NewYork
12. Seneta E (1981) Non-negative matrices and Markov chains. Springer Berlin Heidelberg, NewYork
13. SpearsWM (2000) Evolutionary algorithms. The role of mutation and recombination. Springer Berlin Heidelberg, New York. ISBN 3-540-66950-7
Author information
Authors and Affiliations
Corresponding author
Rights 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
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-005-0027-5