An alternative hypervolume-based selection mechanism for multi-objective evolutionary algorithms

In this paper, we are interested in selection mechanisms based on the hypervolume indicator with a particular emphasis on the mechanism used in an improved version of the S metric selection evolutionary multi-objective algorithm (SMS-EMOA) called iSMS-EMOA, which exploits the locality property of the hypervolume. Here, we propose a new selection scheme which approximates the contribution of solutions to the hypervolume and it is designed to preserve the locality property exploited by iSMS-EMOA. This approach is proposed as an alternative to the use of exact hypervolume calculations and is aimed for solving many-objective optimization problems. The proposed approach is called “approximate version of the improved SMS-EMOA (aviSMS-EMOA)” and is validated using standard test problems (with three or more objectives) and performance indicators taken from the specialized literature. Our preliminary results indicate that our proposed approach is a good alternative to solve many-objective optimization problems, if we consider both quality in the solutions and running time required to obtain them because it outperforms two versions of the original SMS-EMOA that approximate the contributions to the hypervolume, it outperforms MOEA/D using penalty boundary intersection and it is competitive with respect to the original SMS-EMOA in several of the test problems adopted. Also, its computational cost is reasonable (it is slower than MOEA/D, but faster than SMS-EMOA).

[1]  Lucas Bradstreet,et al.  Updating exclusive hypervolume contributions cheaply , 2009, 2009 IEEE Congress on Evolutionary Computation.

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

[3]  M. Farina,et al.  On the optimal solution definition for many-criteria optimization problems , 2002, 2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622).

[4]  R. Lyndon While,et al.  A review of multiobjective test problems and a scalable test problem toolkit , 2006, IEEE Transactions on Evolutionary Computation.

[5]  Dario Izzo,et al.  Empirical Performance of the Approximation of the Least Hypervolume Contributor , 2014, PPSN.

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

[7]  Jürgen Branke,et al.  Multi-objective particle swarm optimization on computer grids , 2007, GECCO '07.

[8]  Hisao Ishibuchi,et al.  Hypervolume approximation using achievement scalarizing functions for evolutionary many-objective optimization , 2009, 2009 IEEE Congress on Evolutionary Computation.

[9]  Eckart Zitzler,et al.  HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization , 2011, Evolutionary Computation.

[10]  Carlos A. Coello Coello,et al.  Solving Multiobjective Optimization Problems Using an Artificial Immune System , 2005, Genetic Programming and Evolvable Machines.

[11]  Carlos M. Fonseca,et al.  Computing Hypervolume Contributions in Low Dimensions: Asymptotically Optimal Algorithm and Complexity Results , 2011, EMO.

[12]  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..

[13]  Nicola Beume,et al.  An EMO Algorithm Using the Hypervolume Measure as Selection Criterion , 2005, EMO.

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

[15]  Anne Auger,et al.  Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point , 2009, FOGA '09.

[16]  Eckart Zitzler,et al.  Improving hypervolume-based multiobjective evolutionary algorithms by using objective reduction methods , 2007, 2007 IEEE Congress on Evolutionary Computation.

[17]  Tobias Friedrich,et al.  Convergence of hypervolume-based archiving algorithms ii: competitiveness , 2012, GECCO.

[18]  Hisao Ishibuchi,et al.  Indicator-based evolutionary algorithm with hypervolume approximation by achievement scalarizing functions , 2010, GECCO '10.

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

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

[21]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation) , 2006 .

[22]  Mark Fleischer,et al.  The measure of pareto optima: Applications to multi-objective metaheuristics , 2003 .

[23]  Eckart Zitzler,et al.  Evolutionary Multi-Criterion Optimization, Third International Conference, EMO 2005, Guanajuato, Mexico, March 9-11, 2005, Proceedings , 2005, EMO.

[24]  Tobias Friedrich,et al.  Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects , 2008, ISAAC.

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

[26]  Stefan Roth,et al.  Covariance Matrix Adaptation for Multi-objective Optimization , 2007, Evolutionary Computation.

[27]  Luigi Barone,et al.  An evolution strategy with probabilistic mutation for multi-objective optimisation , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

[29]  Adriana Menchaca-Mendez,et al.  A new selection mechanism based on hypervolume and its locality property , 2013, 2013 IEEE Congress on Evolutionary Computation.

[30]  Tobias Friedrich,et al.  Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice , 2009, EMO.

[31]  Tobias Friedrich,et al.  Convergence of hypervolume-based archiving algorithms I: effectiveness , 2011, GECCO '11.

[32]  Anne Auger,et al.  Theoretically Investigating Optimal µ-Distributions for the Hypervolume Indicator: First Results for Three Objectives , 2010, PPSN.

[33]  Eckart Zitzler,et al.  Indicator-Based Selection in Multiobjective Search , 2004, PPSN.

[34]  Carlos M. Fonseca,et al.  Evolutionary Multi-Criterion Optimization , 2019, Lecture Notes in Computer Science.

[35]  M. Fleischer,et al.  The Measure of Pareto Optima , 2003, EMO.

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

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