Asymptotic convergence of metaheuristics for multiobjective optimization problems

Authors:
Mario Villalobos-Arias;Carlos A. Coello Coello;Onésimo Hernández-Lerma
Affiliations:
Department of Mathematics, CINVESTAV-IPN, A. Postal 14-740, 07000, México, DF, Mexico and Escuela de Matemática Universidad de Costa Rica, A. Postal 14-740, 07000, San José, D ...;Evolutionary Computation Group Depto. de Ingeniería Eléctrica Seccóon de ComputaciónAv. Instituto Politécnico Nacional, CINVESTAV-IPN, A. Postal 14-740, No. 2508 ...;Department of Mathematics, CINVESTAV-IPN, A. Postal 14-740, 07000, México, DF, Mexico and Escuela de Matemática Universidad de Costa Rica, A. Postal 14-740, 07000, San José, D ...
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Year:
2006

Citing 0
Cited 2

Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front

Information Sciences: an International Journal
An improved MOPSO with a crowding distance based external archive maintenance strategy

ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.