Pareto-adaptive ε-dominance

  • Authors:

  • Alfredo G. Hernández-Díaz;Luis V. Santana-Quintero;Carlos A. Coello Coello;Julián Molina

  • Affiliations:

  • Department of Quantitative Methods, Pablo de Olavide University, Seville, Spain agarher@upo.es;Centro de Investigación y de Estudios Avanzados, México D.F., México lvspenny@hotmail.com;Centro de Investigación y de Estudios Avanzados, México D.F., México ccoello@cs.cinvestav.mx;Department of Applied Economics (Mathematics), University of Málaga, Málaga Spain julian.molina@uma.es

  • Venue:
  • Evolutionary Computation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Efficiency has become one of the main concerns in evolutionary multiobjective optimization during recent years. One of the possible alternatives to achieve a faster convergence is to use a relaxed form of Pareto dominance that allows us to regulate the granularity of the approximation of the Pareto front that we wish to achieve. One such relaxed forms of Pareto dominance that has become popular in the last few years is ε-dominance, which has been mainly used as an archiving strategy in some multiobjective evolutionary algorithms. Despite its advantages, ε-dominance has some limitations. In this paper, we propose a mechanism that can be seen as a variant of ε-dominance, which we call Pareto-adaptive ε-dominance (paε-dominance). Our proposed approach tries to overcome the main limitation of ε-dominance: the loss of several nondominated solutions from the hypergrid adopted in the archive because of the way in which solutions are selected within each box.