On the effect of normalization in MOEA/D for multi-objective and many-objective optimization

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 $$\theta $$θ-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. Test problems in one variant have objective functions with totally different ranges. The other variant has a kind of deceptive nature, 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.

[1]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[2]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[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]  Peter J. Fleming,et al.  On the Evolutionary Optimization of Many Conflicting Objectives , 2007, IEEE Transactions on Evolutionary Computation.

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

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

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

[8]  Hisao Ishibuchi,et al.  Evolutionary many-objective optimization by NSGA-II and MOEA/D with large populations , 2009, 2009 IEEE International Conference on Systems, Man and Cybernetics.

[9]  Eckart Zitzler,et al.  HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization , 2011, Evolutionary Computation.

[10]  Hiroyuki Sato,et al.  Inverted PBI in MOEA/D and its impact on the search performance on multi and many-objective optimization , 2014, GECCO.

[11]  Qingfu Zhang,et al.  Stable Matching-Based Selection in Evolutionary Multiobjective Optimization , 2014, IEEE Transactions on Evolutionary Computation.

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

[13]  Fang Liu,et al.  MOEA/D with Adaptive Weight Adjustment , 2014, Evolutionary Computation.

[14]  Carlos A. Brizuela,et al.  A survey on multi-objective evolutionary algorithms for many-objective problems , 2014, Computational Optimization and Applications.

[15]  Peter J. Fleming,et al.  Generalized decomposition and cross entropy methods for many-objective optimization , 2014, Inf. Sci..

[16]  Yang Liu,et al.  Collaborative Security , 2015, ACM Comput. Surv..

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

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

[19]  Qingfu Zhang,et al.  Interrelationship-Based Selection for Decomposition Multiobjective Optimization , 2015, IEEE Transactions on Cybernetics.

[20]  Tapabrata Ray,et al.  A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization , 2015, IEEE Transactions on Evolutionary Computation.

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

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

[23]  Qingfu Zhang,et al.  Are All the Subproblems Equally Important? Resource Allocation in Decomposition-Based Multiobjective Evolutionary Algorithms , 2016, IEEE Transactions on Evolutionary Computation.

[24]  Hisao Ishibuchi,et al.  Use of Piecewise Linear and Nonlinear Scalarizing Functions in MOEA/D , 2016, PPSN.

[25]  Dipti Srinivasan,et al.  A Survey of Multiobjective Evolutionary Algorithms Based on Decomposition , 2017, IEEE Transactions on Evolutionary Computation.

[26]  Tapabrata Ray,et al.  Decomposition Based Evolutionary Algorithm with a Dual Set of reference vectors , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

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

[28]  Tao Zhang,et al.  Localized Weighted Sum Method for Many-Objective Optimization , 2018, IEEE Transactions on Evolutionary Computation.