An archiving strategy based on the Convex Hull of Individual Minima for MOEAs

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.

[1]  Beatrice Lazzerini,et al.  A new multi-objective evolutionary algorithm based on convex hull for binary classifier optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

[2]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[3]  Samir W. Mahfoud.  Niching methods for genetic algorithms , 1996 .

[4]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[5]  Jason R. Schott.  Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization. , 1995 .

[6]  Indraneel Das,et al.  Nonlinear Multicriteria Optimization and Robust Optimality , 1997 .

[7]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[8]  Jeffrey Horn,et al.  Multicriterion decision making , 1997 .

[9]  Indraneel Das.  On characterizing the “knee” of the Pareto curve based on Normal-Boundary Intersection , 1999 .

[10]  David W. Corne,et al.  Properties of an adaptive archiving algorithm for storing nondominated vectors , 2003, IEEE Trans. Evol. Comput..

[11]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[12]  Marco Laumanns,et al.  Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[13]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[14]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[15]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[16]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[17]  A. Farhang-Mehr,et al.  Diversity assessment of Pareto optimal solution sets: an entropy approach , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[18]  Carlos A. Coello Coello,et al.  Approximating the epsilon -Efficient Set of an MOP with Stochastic Search Algorithms , 2007, MICAI.

[19]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[20]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[21]  J. Dennis,et al.  NORMAL-BOUNDARY INTERSECTION: AN ALTERNATE METHOD FOR GENERATING PARETO OPTIMAL POINTS IN MULTICRITERIA OPTIMIZATION PROBLEMS , 1996 .

[22]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[23]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

[24]  E. Talbi,et al.  Approximating the -Efficient Set of an MOP with Stochastic Search Algorithms , 2007 .

[25]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[26]  Marco Laumanns,et al.  Archiving With Guaranteed Convergence And Diversity In Multi-objective Optimization , 2002, GECCO.