A Multiobjective Test Suite with Hexagon Pareto Fronts and Various Feasible Regions

The performance of a Multiobjective Evolutionary Algorithm (MOEA) for many-objective optimization is often evaluated by multiobjective scalable test problems like DTLZ and WFG problems. This is because the scalable test problems are quite useful for an MOEA analysis. However, the scalable test problems do not have enough diversity of the shapes of the Pareto front and the feasible region to evaluate the capability of MOEAs. Previous studies showed that these shapes have a great impact on the performance of MOEAs. Thus, MOEAs should be evaluated on more test problems with different shapes of the Pareto front and the feasible region. In this study, the shapes of the Pareto front in the existing scalable test problems are examined from some viewpoints such as the distribution of optimal or worst solutions for each objective and the degree of the correspondence with the distribution of the weight vectors. The shape of the feasible region is also examined from the viewpoint of the spread of an initial population and the existence of dominance resistant solutions. According to the observations, we propose new shapes of the Pareto front and the feasible region to design a new scalable test suite. Experimental results show that the proposed test suite has totally different properties from the existing test problems.

[1]  Antonio J. Nebro,et al.  Redesigning the jMetal Multi-Objective Optimization Framework , 2015, GECCO.

[2]  Shengxiang Yang,et al.  Pareto or Non-Pareto: Bi-Criterion Evolution in Multiobjective Optimization , 2016, IEEE Transactions on Evolutionary Computation.

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

[4]  Hisao Ishibuchi,et al.  Behavior of Multiobjective Evolutionary Algorithms on Many-Objective Knapsack Problems , 2015, IEEE Transactions on Evolutionary Computation.

[5]  Xin Yao,et al.  What Weights Work for You? Adapting Weights for Any Pareto Front Shape in Decomposition-Based Evolutionary Multiobjective Optimisation , 2017, Evolutionary Computation.

[6]  Hisao Ishibuchi,et al.  Performance Comparison of Multiobjective Evolutionary Algorithms on Problems with Partially Different Properties from Popular Test Suites , 2018, 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[7]  Kalyanmoy Deb,et al.  A combined genetic adaptive search (GeneAS) for engineering design , 1996 .

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

[9]  Ricardo H. C. Takahashi,et al.  On the Performance Degradation of Dominance-Based Evolutionary Algorithms in Many-Objective Optimization , 2018, IEEE Transactions on Evolutionary Computation.

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

[11]  Hisao Ishibuchi,et al.  Common properties of scalable multiobjective problems and a new framework of test problems , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[12]  Qingfu Zhang,et al.  An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition , 2015, IEEE Transactions on Evolutionary Computation.

[13]  Peter J. Fleming,et al.  On the Evolutionary Optimization of Many Conflicting Objectives , 2007, IEEE Transactions on Evolutionary Computation.

[14]  Hisao Ishibuchi,et al.  On Scalable Multiobjective Test Problems With Hardly Dominated Boundaries , 2019, IEEE Transactions on Evolutionary Computation.

[15]  R. Lyndon While,et al.  A faster algorithm for calculating hypervolume , 2006, IEEE Transactions on Evolutionary Computation.

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

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

[18]  Kiyoshi Tanaka,et al.  A Review of Features and Limitations of Existing Scalable Multiobjective Test Suites , 2019, IEEE Transactions on Evolutionary Computation.

[19]  Qingfu Zhang,et al.  A Generator for Multiobjective Test Problems With Difficult-to-Approximate Pareto Front Boundaries , 2019, IEEE Transactions on Evolutionary Computation.

[20]  Bernhard Sendhoff,et al.  A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization , 2016, IEEE Transactions on Evolutionary Computation.

[21]  Hisao Ishibuchi,et al.  Review of coevolutionary developments of evolutionary multi-objective and many-objective algorithms and test problems , 2014, 2014 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making (MCDM).

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