Asymptotic convergence of some metaheuristics used for multiobjective optimization

  • Authors:
  • Mario Villalobos-Arias;Carlos A. Coello Coello;Onésimo Hernández-Lerma

  • Affiliations:
  • Department of Mathematics, CINVESTAV-IPN, México, D.F., Mexico;Depto. de Ingeniería Eléctrica, Sección de Computación, CINVESTAV-IPN, Evolutionary Computation Group, México, D. F., Mexico;Department of Mathematics, CINVESTAV-IPN, México, D.F., Mexico

  • Venue:
  • FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents the asymptotic convergence analysis of Simulated Annealing, an Artificial Immune System and a General Evolutionary Algorithm for multiobjective optimization problems. In the case of a General Evolutionary Algorithm, we refer to any algorithm in which the transition probabilities use a uniform mutation rule. We prove that these algorithms converge if elitism is used.