Improving the integration of the IGD+ indicator into the selection mechanism of a Multi-objective Evolutionary Algorithm

In recent years, the design of new selection mechanisms based on quality indicators has become a popular trend in the development of Multi-Objective Evolutionary Algorithms (MOEAs). This trend has been motivated by the well-known limitations of Pareto-based MOEAs when dealing with many-objective optimization problems (i.e., problems having more than 3 objectives). In this paper, we propose a selection mechanism (called IGD+-H) which is based on the combination of the Inverted Generational Distance+ (IGD+) indicator and Kuhn-Munkres' (Hungarian) algorithm to solve Linear Assignment Problems (LAPs). The proposed selection scheme is compared with respect to other selection mechanisms based on the IGD indicator and with respect to the use of the Δp indicator. Our proposed technique is incorporated into a MOEA and is validated using standard test functions. Our comparative study indicates that both Δp and IGD present some limitations when selecting solutions in degenerate multi-objective problems. Our results show that the transformation of the selection mechanism into a linear assignment problem speeds up the convergence of the MOEA and it is able to solve many-objective problems in an effective and efficient manner. We show that our proposed IGD+-H-based selection mechanism is able to achieve a significant speed up (of up to 200×) with respect to the exclusive use of any of the indicators adopted in our study.

[1]  Carlos A. Coello Coello,et al.  Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[2]  Carlos A. Coello Coello,et al.  Evolutionary Many-Objective Optimization Based on Kuhn-Munkres' Algorithm , 2015, EMO.

[3]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[4]  Carlos A. Coello Coello,et al.  A Study of the Parallelization of a Coevolutionary Multi-objective Evolutionary Algorithm , 2004, MICAI.

[5]  Nicola Beume,et al.  S-Metric Calculation by Considering Dominated Hypervolume as Klee's Measure Problem , 2009, Evolutionary Computation.

[6]  François Bourgeois,et al.  An extension of the Munkres algorithm for the assignment problem to rectangular matrices , 1971, CACM.

[7]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

[8]  G. Rudolph,et al.  Finding evenly spaced fronts for multiobjective control via averaging Hausdorff-measure , 2011, 2011 8th International Conference on Electrical Engineering, Computing Science and Automatic Control.

[9]  Hisao Ishibuchi,et al.  Evolutionary many-objective optimization: A short review , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[10]  Carlos A. Coello Coello,et al.  A new multi-objective evolutionary algorithm based on a performance assessment indicator , 2012, GECCO.

[11]  Adriana Menchaca-Mendez,et al.  Δp-MOEA: A new multi-objective evolutionary algorithm based on the Δp indicator , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[12]  Günter Rudolph,et al.  Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems , 2012, EVOLVE.

[13]  Heike Trautmann,et al.  On the properties of the R2 indicator , 2012, GECCO '12.

[14]  Hisao Ishibuchi,et al.  Modified Distance Calculation in Generational Distance and Inverted Generational Distance , 2015, EMO.

[15]  Hisao Ishibuchi,et al.  Evolutionary many-objective optimization , 2008, 2008 3rd International Workshop on Genetic and Evolving Systems.

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

[17]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

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

[19]  Carlos A. Coello Coello,et al.  IGD+-EMOA: A multi-objective evolutionary algorithm based on IGD+ , 2016, CEC.

[20]  Saúl Zapotecas Martínez,et al.  Using a Family of Curves to Approximate the Pareto Front of a Multi-Objective Optimization Problem , 2014, PPSN.

[21]  Nicola Beume,et al.  SMS-EMOA: Multiobjective selection based on dominated hypervolume , 2007, Eur. J. Oper. Res..

[22]  Tobias Friedrich,et al.  Approximating the least hypervolume contributor: NP-hard in general, but fast in practice , 2008, Theor. Comput. Sci..