Riesz s-energy-based Reference Sets for Multi-Objective optimization

Currently, reference sets, which are a collection of feasible or infeasible points in objective space, are the backbone of several multi-objective evolutionary algorithms (MOEAs) and quality indicators (QIs). For both MOEAs and QIs, an important question is how to construct the reference set regardless of the dimensionality of the objective space, preserving well-diversified solutions. The Simplex-Lattice-Design method (SLD) that constructs a set of convex weights in a simplex, has been usually used to define reference sets. However, it is not a good option since Pareto fronts with irregular geometries cannot be completely intersected by the weight vectors. In this paper, we propose a tool based on the Riesz s-energy to generate reference sets exhibiting good diversity properties. Our experimental results support the Riesz s-energy-based reference sets as a better option due to their invariance to the Pareto front shape and the objective space dimensionality.

[1]  Hisao Ishibuchi,et al.  Sensitivity of performance evaluation results by inverted generational distance to reference points , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

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

[3]  E. Saff,et al.  Discretizing Manifolds via Minimum Energy Points , 2004 .

[4]  Kalyanmoy Deb,et al.  Investigating the Effect of Imbalance Between Convergence and Diversity in Evolutionary Multiobjective Algorithms , 2017, IEEE Transactions on Evolutionary Computation.

[5]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

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

[7]  Michael T. M. Emmerich,et al.  On the Cooperation of Multiple Indicator-based Multi-Objective Evolutionary Algorithms , 2019, 2019 IEEE Congress on Evolutionary Computation (CEC).

[8]  Hisao Ishibuchi,et al.  Reference Point Specification in Inverted Generational Distance for Triangular Linear Pareto Front , 2018, IEEE Transactions on Evolutionary Computation.

[9]  Hisao Ishibuchi,et al.  Performance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes , 2017, IEEE Transactions on Evolutionary Computation.

[10]  Xin Yao,et al.  Many-Objective Evolutionary Algorithms , 2015, ACM Comput. Surv..

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

[12]  Ye Tian,et al.  PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective Optimization [Educational Forum] , 2017, IEEE Computational Intelligence Magazine.

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

[14]  E. Saff,et al.  Minimal Riesz Energy Point Configurations for Rectifiable d-Dimensional Manifolds , 2003, math-ph/0311024.

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

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

[17]  Carlos A. Coello Coello,et al.  A hyper-heuristic of scalarizing functions , 2017, GECCO.

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

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