DocumentCode :
2333153
Title :
An archiving strategy based on the Convex Hull of Individual Minima for MOEAs
Author :
Martínez, Saúl Zapotecas ; Coello, Carlos A Coello
Author_Institution :
Dept. de Com-putacion (Evolutionary Comput. Group), CINVESTAV-IPN, Mexico City, Mexico
fYear :
2010
fDate :
18-23 July 2010
Firstpage :
1
Lastpage :
8
Abstract :
Diversity plays an important role in evolutionary multi-objective optimization. Because of this, a number of density estimators (i.e., mechanisms that help to maintain diversity) have been proposed since the early days of multi-objective evolutionary algorithms (MOEAs). Fitness sharing and niching were among the most popular density estimator used with non-elitist MOEAs, but their main drawback was their high dependence on the niche radius, which was normally difficult to set. In recent years, the use of external archives to store the nondominated solutions found by an elitist MOEA has become popular. This has motivated an important amount of research related to archiving techniques for MOEAs. In this paper, we contribute to such literature by introducing a new archiving strategy based on the Convex Hull of Individual Minima (CHIM). Our proposed approach is compared with respect to two competitive MOEAs (NSGA-II and SPEA2) using standard test problems and performance measures taken from the specialized literature.
Keywords :
Pareto distribution; convex programming; evolutionary computation; Pareto distribution; Pareto optimal set; archiving strategy; competitive MOEA; convex hull; density estimator; fitness sharing; individual minima; multiobjective evolutionary algorithm; niching; Approximation methods; Computational complexity; Equations; Evolutionary computation; Optimization; Proposals; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation (CEC), 2010 IEEE Congress on
Conference_Location :
Barcelona
Print_ISBN :
978-1-4244-6909-3
Type :
conf
DOI :
10.1109/CEC.2010.5586462
Filename :
5586462
Link To Document :
بازگشت