Relation Between Weight Vectors and Solutions in MOEA/D

An important implementation issue in MOEA/D (multiobjective evolutionary algorithm based on decomposition) is the specification of a scalarizing function. For its appropriate specification, it is necessary to understand the search behavior of MOEA/D for various settings of a scalarizing function. Especially, it is important to understand the relation between weight vectors and obtained solutions. The understanding of this relation is also very important for the incorporation of preference information into MOEA/D through weight vector specification. In this paper, we examine the mapping from weight vectors to solutions by monitoring which solution is obtained from each weight vector. MOEA/D with a number of different settings of a scalarizing function is applied to knapsack problems and DTLZ2 with 2-6 objectives. As a scalarizing function, we use the weighted sum, the weighted Tchebycheff and the PBI (penalty-based boundary intersection). We report some interesting observations obtained from computational experiments. Among them are the existence of many duplicated solutions, their positive and negative effects, and a dominant effect of the penalty parameter value in the PBI.

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

[2]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

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

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

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

[6]  Qingfu Zhang,et al.  Constrained Subproblems in a Decomposition-Based Multiobjective Evolutionary Algorithm , 2016, IEEE Transactions on Evolutionary Computation.

[7]  Yaochu Jin,et al.  Dynamic Weighted Aggregation for evolutionary multi-objective optimization: why does it work and how? , 2001 .

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

[9]  Eckart Zitzler,et al.  Indicator-Based Selection in Multiobjective Search , 2004, PPSN.

[10]  Mitsuo Gen,et al.  Specification of Genetic Search Directions in Cellular Multi-objective Genetic Algorithms , 2001, EMO.

[11]  Qingfu Zhang,et al.  Decomposition of a Multiobjective Optimization Problem Into a Number of Simple Multiobjective Subproblems , 2014, IEEE Transactions on Evolutionary Computation.

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

[13]  Lothar Thiele,et al.  The Hypervolume Indicator Revisited: On the Design of Pareto-compliant Indicators Via Weighted Integration , 2007, EMO.

[14]  Bo Zhang,et al.  Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers , 2016, IEEE Transactions on Evolutionary Computation.

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

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

[17]  Hisao Ishibuchi,et al.  Comparing solution sets of different size in evolutionary many-objective optimization , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

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

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

[20]  Hisao Ishibuchi,et al.  Multi-objective genetic local search algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[21]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

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

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

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

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