What Weights Work for You? Adapting Weights for Any Pareto Front Shape in Decomposition-Based Evolutionary Multiobjective Optimisation

The quality of solution sets generated by decomposition-based evolutionary multi-objective optimisation (EMO) algorithms depends heavily on the consistency between a given problem's Pareto front shape and the specified weights' distribution. A set of weights distributed uniformly in a simplex often leads to a set of well-distributed solutions on a Pareto front with a simplex-like shape, but may fail on other Pareto front shapes. It is an open problem on how to specify a set of appropriate weights without the information of the problem's Pareto front beforehand. In this article, we propose an approach to adapt weights during the evolutionary process (called AdaW). AdaW progressively seeks a suitable distribution of weights for the given problem by elaborating several key parts in weight adaptation—weight generation, weight addition, weight deletion, and weight update frequency. Experimental results have shown the effectiveness of the proposed approach. AdaW works well for Pareto fronts with very different shapes: 1) the simplex-like, 2) the inverted simplex-like, 3) the highly nonlinear, 4) the disconnect, 5) the degenerate, 6) the scaled, and 7) the high-dimensional.

[1]  Xin Yao,et al.  A benchmark test suite for evolutionary many-objective optimization , 2017 .

[2]  Qingfu Zhang,et al.  Decomposition-Based Algorithms Using Pareto Adaptive Scalarizing Methods , 2016, IEEE Transactions on Evolutionary Computation.

[3]  Qingfu Zhang,et al.  Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II , 2009, IEEE Transactions on Evolutionary Computation.

[4]  Shengxiang Yang,et al.  Evolutionary Algorithms With Segment-Based Search for Multiobjective Optimization Problems , 2014, IEEE Transactions on Cybernetics.

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

[6]  Ye Tian,et al.  PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective Optimization [Educational Forum] , 2017, IEEE Computational Intelligence Magazine.

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

[8]  Shengxiang Yang,et al.  Pareto or Non-Pareto: Bi-Criterion Evolution in Multiobjective Optimization , 2016, IEEE Transactions on Evolutionary Computation.

[9]  Yiu-Ming Cheung,et al.  Self-Organizing Map-Based Weight Design for Decomposition-Based Many-Objective Evolutionary Algorithm , 2018, IEEE Transactions on Evolutionary Computation.

[10]  Bernhard Sendhoff,et al.  Adapting Weighted Aggregation for Multiobjective Evolution Strategies , 2001, EMO.

[11]  K. Deb,et al.  On Finding Pareto-Optimal Solutions Through Dimensionality Reduction for Certain Large-Dimensional Multi-Objective Optimization Problems , 2022 .

[12]  Xin Yao,et al.  How to Read Many-Objective Solution Sets in Parallel Coordinates [Educational Forum] , 2017, IEEE Computational Intelligence Magazine.

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

[14]  Xin Yao,et al.  of Birmingham Quality evaluation of solution sets in multiobjective optimisation , 2019 .

[15]  Saúl Zapotecas Martínez,et al.  A direct local search mechanism for decomposition-based multi-objective evolutionary algorithms , 2012, 2012 IEEE Congress on Evolutionary Computation.

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

[17]  Qingfu Zhang,et al.  An External Archive Guided Multiobjective Evolutionary Algorithm Based on Decomposition for Combinatorial Optimization , 2015, IEEE Transactions on Evolutionary Computation.

[18]  Bernhard Sendhoff,et al.  A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization , 2016, IEEE Transactions on Evolutionary Computation.

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

[20]  Jie Zhang,et al.  Multiobjective optimization by decomposition with Pareto-adaptive weight vectors , 2011, ICNC.

[21]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[22]  Qingfu Zhang,et al.  On the use of two reference points in decomposition based multiobjective evolutionary algorithms , 2017, Swarm Evol. Comput..

[23]  Qingfu Zhang,et al.  On the use of random weights in MOEA/D , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[24]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. II. Application example , 1998, IEEE Trans. Syst. Man Cybern. Part A.

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

[26]  Hui Li,et al.  An Adaptive Evolutionary Multi-Objective Approach Based on Simulated Annealing , 2011, Evolutionary Computation.

[27]  Peter J. Fleming,et al.  Towards Understanding the Cost of Adaptation in Decomposition-Based Optimization Algorithms , 2013, 2013 IEEE International Conference on Systems, Man, and Cybernetics.

[28]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[29]  Marco Laumanns,et al.  Combining Convergence and Diversity in Evolutionary Multiobjective Optimization , 2002, Evolutionary Computation.

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

[31]  Fang Liu,et al.  MOEA/D with uniform decomposition measurement for many-objective problems , 2014, Soft Comput..

[32]  Qguhm -DVNLHZLF.  On the performance of multiple objective genetic local search on the 0 / 1 knapsack problem . A comparative experiment , 2000 .

[33]  Kaname Narukawa,et al.  Adaptive Reference Vector Generation for Inverse Model Based Evolutionary Multiobjective Optimization with Degenerate and Disconnected Pareto Fronts , 2015, EMO.

[34]  Peter J. Fleming,et al.  Generalized Decomposition , 2013, EMO.

[35]  Tapabrata Ray,et al.  Six-Sigma Robust Design Optimization Using a Many-Objective Decomposition-Based Evolutionary Algorithm , 2015, IEEE Transactions on Evolutionary Computation.

[36]  Shengxiang Yang,et al.  A Performance Comparison Indicator for Pareto Front Approximations in Many-Objective Optimization , 2015, GECCO.

[37]  Xinye Cai,et al.  A Decomposition-Based Many-Objective Evolutionary Algorithm With Two Types of Adjustments for Direction Vectors , 2018, IEEE Transactions on Cybernetics.

[38]  Qingfu Zhang,et al.  An evolutionary many-objective optimisation algorithm with adaptive region decomposition , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

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

[40]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

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

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

[43]  Tao Zhang,et al.  On the effect of reference point in MOEA/D for multi-objective optimization , 2017, Appl. Soft Comput..

[44]  Lothar Thiele,et al.  Quality Assessment of Pareto Set Approximations , 2008, Multiobjective Optimization.

[45]  Evan J. Hughes,et al.  Evolutionary many-objective optimisation: many once or one many? , 2005, 2005 IEEE Congress on Evolutionary Computation.

[46]  H. Ishibuchi,et al.  On the effect of normalization in MOEA/D for multi-objective and many-objective optimization , 2017 .

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

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

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

[50]  Shengxiang Yang,et al.  ETEA: A Euclidean Minimum Spanning Tree-Based Evolutionary Algorithm for Multi-Objective Optimization , 2014, Evolutionary Computation.

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

[52]  Xin Yao,et al.  A Memetic Algorithm for Periodic Capacitated Arc Routing Problem , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[53]  H. Kita,et al.  Failure of Pareto-based MOEAs: does non-dominated really mean near to optimal? , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[54]  Shengxiang Yang,et al.  A Strength Pareto Evolutionary Algorithm Based on Reference Direction for Multiobjective and Many-Objective Optimization , 2017, IEEE Transactions on Evolutionary Computation.

[55]  Tapabrata Ray,et al.  An Enhanced Decomposition-Based Evolutionary Algorithm With Adaptive Reference Vectors , 2018, IEEE Transactions on Cybernetics.

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

[57]  Qingfu Zhang,et al.  The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances , 2009, 2009 IEEE Congress on Evolutionary Computation.

[58]  Peter J. Fleming,et al.  Preference-inspired co-evolutionary algorithms using weight vectors , 2015, Eur. J. Oper. Res..

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

[60]  Carlos A. Coello Coello,et al.  A Study of the Parallelization of a Coevolutionary Multi-objective Evolutionary Algorithm , 2004, MICAI.

[61]  Tapabrata Ray,et al.  An adaptive constraint handling approach embedded MOEA/D , 2012, 2012 IEEE Congress on Evolutionary Computation.

[62]  Peter J. Fleming,et al.  On finding well-spread pareto optimal solutions by preference-inspired co-evolutionary algorithm , 2013, GECCO '13.

[63]  Hisao Ishibuchi,et al.  How to Specify a Reference Point in Hypervolume Calculation for Fair Performance Comparison , 2018, Evolutionary Computation.

[64]  Ye Tian,et al.  An Indicator-Based Multiobjective Evolutionary Algorithm With Reference Point Adaptation for Better Versatility , 2018, IEEE Transactions on Evolutionary Computation.

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

[66]  Xin Yao,et al.  Multiline Distance Minimization: A Visualized Many-Objective Test Problem Suite , 2018, IEEE Transactions on Evolutionary Computation.

[67]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[68]  Yuren Zhou,et al.  An angle based constrained many-objective evolutionary algorithm , 2017, Applied Intelligence.

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

[70]  Hisao Ishibuchi,et al.  Reference Point Specification in Inverted Generational Distance for Triangular Linear Pareto Front , 2018, IEEE Transactions on Evolutionary Computation.

[71]  Kay Chen Tan,et al.  A Hybrid Estimation of Distribution Algorithm with Decomposition for Solving the Multiobjective Multiple Traveling Salesman Problem , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[72]  Carolina P. de Almeida,et al.  An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem , 2012, Ann. Oper. Res..

[73]  Liang Gao,et al.  Adjust weight vectors in MOEA/D for bi-objective optimization problems with discontinuous Pareto fronts , 2017, Soft Computing.

[74]  Jiang Siwei,et al.  Multiobjective optimization by decomposition with Pareto-adaptive weight vectors , 2011, 2011 Seventh International Conference on Natural Computation.

[75]  Kay Chen Tan,et al.  A multiobjective evolutionary algorithm using dynamic weight design method , 2012 .

[76]  Hong Li,et al.  MOEA/D + uniform design: A new version of MOEA/D for optimization problems with many objectives , 2013, Comput. Oper. Res..

[77]  Qingfu Zhang,et al.  Adaptively Allocating Search Effort in Challenging Many-Objective Optimization Problems , 2018, IEEE Transactions on Evolutionary Computation.

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

[79]  Qingfu Zhang,et al.  Multi-objective Local Search Based on Decomposition , 2016, PPSN.

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

[81]  Yuren Zhou,et al.  A Vector Angle-Based Evolutionary Algorithm for Unconstrained Many-Objective Optimization , 2017, IEEE Transactions on Evolutionary Computation.

[82]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation , 1998, IEEE Trans. Syst. Man Cybern. Part A.