Performance Comparison of Multiobjective Evolutionary Algorithms on Problems with Partially Different Properties from Popular Test Suites

A Multiobjective Evolutionary Algorithm (MOEA) is one of the effective approaches for solving Multiobjective Optimization Problems (MOPs). The performance of MOEAs is evaluated mainly by scalable MOP test suites where the number of objectives can be arbitrarily specified. However, the number of scalable MOP test suites is quite limited and their properties are similar. Thus, there is a risk that the current research on MOEAs is specialized for some properties (i.e., a shape of feasible regions, a shape of the Pareto front, and a distance function) of existing scalable MOP test suites. In this paper, we focus on the above properties of two popular MOP test suites (i.e., DTLZ and WFG). Based on DTLZ and WFG, we create 12 MOPs which have partially different properties from those of DTLZ and WFG. Computational experiments show that the search performance of the state-of-the-art MOEAs strongly depends on three properties.

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

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

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

[4]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

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

[6]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[7]  Gary B. Lamont,et al.  Applications Of Multi-Objective Evolutionary Algorithms , 2004 .

[8]  Xin Yao,et al.  A New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization , 2016, IEEE Transactions on Evolutionary Computation.

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

[10]  Tong Heng Lee,et al.  Multiobjective Evolutionary Algorithms and Applications , 2005, Advanced Information and Knowledge Processing.

[11]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

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

[13]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach , 2014, IEEE Transactions on Evolutionary Computation.

[14]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

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

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

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