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.