On the use of two reference points in decomposition based multiobjective evolutionary algorithms

Decomposition based multiobjective evolutionary algorithms approximate the Pareto front of a multiobjective optimization problem by optimizing a set of subproblems in a collaborative manner. Often, each subproblem is associated with a direction vector and a reference point. The settings of these parameters have a very critical impact on convergence and diversity of the algorithm. Some work has been done to study how to set and adjust direction vectors to enhance algorithm performance for particular problems. In contrast, little effort has been made to study how to use reference points for controlling diversity in decomposition based algorithms. In this paper, we first study the impact of the reference point setting on selection in decomposition based algorithms. To balance the diversity and convergence, a new variant of the multiobjective evolutionary algorithm based on decomposition with both the ideal point and the nadir point is then proposed. This new variant also employs an improved global replacement strategy for performance enhancement. Comparison of our proposed algorithm with some other state-of-the-art algorithms is conducted on a set of multiobjective test problems. Experimental results show that our proposed algorithm is promising.

[1]  Qingfu Zhang,et al.  Adaptive Replacement Strategies for MOEA/D , 2016, IEEE Transactions on Cybernetics.

[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]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[5]  Rubén Saborido,et al.  Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front , 2017, Evolutionary Computation.

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

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

[8]  Qingfu Zhang,et al.  A replacement strategy for balancing convergence and diversity in MOEA/D , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

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

[10]  Marco Laumanns,et al.  SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .

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

[12]  Xiaodong Li,et al.  Integrating user preferences and decomposition methods for many-objective optimization , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

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

[14]  Xiaodong Li,et al.  Sensitivity analysis of Penalty-based Boundary Intersection on aggregation-based EMO algorithms , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[15]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

[16]  Hisao Ishibuchi,et al.  Adaptation of Scalarizing Functions in MOEA/D: An Adaptive Scalarizing Function-Based Multiobjective Evolutionary Algorithm , 2009, EMO.

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

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

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

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

[21]  Qingfu Zhang,et al.  MOEA/D with NBI-style Tchebycheff approach for portfolio management , 2010, IEEE Congress on Evolutionary Computation.

[22]  Hisao Ishibuchi,et al.  Simultaneous use of different scalarizing functions in MOEA/D , 2010, GECCO '10.

[23]  Shengxiang Yang,et al.  An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts , 2016, IEEE Transactions on Cybernetics.

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

[25]  Jinhua Zheng,et al.  Decomposing the user-preference in multiobjective optimization , 2016, Soft Comput..

[26]  Carlos A. Coello Coello,et al.  Improving PSO-Based Multi-objective Optimization Using Crowding, Mutation and epsilon-Dominance , 2005, EMO.

[27]  C. Coello,et al.  Improving PSO-based Multi-Objective Optimization using Crowding , Mutation and �-Dominance , 2005 .

[28]  Kalyanmoy Deb,et al.  A combined genetic adaptive search (GeneAS) for engineering design , 1996 .

[29]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

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

[31]  Xiaodong Li,et al.  Reference point based multi-objective optimization through decomposition , 2012, 2012 IEEE Congress on Evolutionary Computation.

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

[33]  Hisao Ishibuchi,et al.  Relation Between Weight Vectors and Solutions in MOEA/D , 2015, 2015 IEEE Symposium Series on Computational Intelligence.

[34]  Hisao Ishibuchi,et al.  Relation between Neighborhood Size and MOEA/D Performance on Many-Objective Problems , 2013, EMO.

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

[36]  J. Jahn.  Mathematical vector optimization in partially ordered linear spaces , 1986 .

[37]  Yiu-ming Cheung,et al.  T-MOEA/D: MOEA/D with Objective Transform in Multi-objective Problems , 2010, 2010 International Conference of Information Science and Management Engineering.

[38]  R. Lyndon While,et al.  A review of multiobjective test problems and a scalable test problem toolkit , 2006, IEEE Transactions on Evolutionary Computation.

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

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

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

[42]  Hisao Ishibuchi,et al.  Effects of using two neighborhood structures on the performance of cellular evolutionary algorithms for many-objective optimization , 2009, 2009 IEEE Congress on Evolutionary Computation.

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

[44]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..