The frequently used basic version of MOEA/D (multi-objective evolutionary algorithm based on decomposition) has no normalization mechanism of the objective space, whereas the normalization was discussed in the original MOEA/D paper. As a result, MOEA/D shows difficulties in finding a set of uniformly distributed solutions over the entire Pareto front when each objective has a totally different range of objective values. Recent variants of MOEA/D have normalization mechanisms for handling such a scaling issue. In this paper, we examine the effect of the normalization of the objective space on the performance of MOEA/D through computational experiments. A simple normalization mechanism is used to examine the performance of MOEA/D with and without normalization. These two types of MOEA/D are also compared with recently proposed many-objective algorithms: NSGA-III, MOEA/DD, and θ -DEA. In addition to the frequently used many-objective test problems DTLZ and WFG, we use their minus versions. We also propose two variants of the DTLZ test problems for examining the effect of the normalization in MOEA/D. where the range of each objective is the same on the Pareto front but totally different over the entire feasible region. Computational experiments on those test problems clearly show the necessity of the normalization. It is also shown that the normalization has both positive and negative effects on the performance of MOEA/D. These observations suggest that the influence of the normalization is strongly problem dependent.

No abstract

No abstract

No abstract

No abstract

No abstract

No abstract