Reference point specification in MOEA/D for multi-objective and many-objective problems

Recently a number of evolutionary multi-objective optimization (EMO) algorithms have been proposed using the framework of MOEA/D (multi-objective evolutionary algorithm based on decomposition). Those algorithms are characterized by the use of uniformly distributed normalized weight vectors from which a set of uniformly distributed reference lines is generated. Their basic idea is to search for a Pareto optimal solution along each reference line. While they are different in various aspects such as fitness evaluation, solution assignment to each reference line, and solution replacement, they share the same basic idea (i.e., to search for a Pareto optimal solution along each reference line). The importance of weight vector specification has been emphasized in the literature. However, the specification of a reference point has not been examined in detail whereas it plays an important role as a starting point of all reference lines. The reference point usually consists of the best value of each objective over the examined solutions, which is an approximation of the ideal point. However, this approximation is not good in early generations where the true ideal point may be much better than the best value of each objective over the examined solutions (even if it is very good in later generations). Based on these discussions, we propose a reference point specification method.

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

[2]  Hisao Ishibuchi,et al.  Evolutionary many-objective optimization , 2008, 2008 3rd International Workshop on Genetic and Evolving Systems.

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

[4]  Xin Yao,et al.  Stochastic Ranking Algorithm for Many-Objective Optimization Based on Multiple Indicators , 2016, IEEE Transactions on Evolutionary Computation.

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

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

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

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

[9]  Kalyanmoy Deb,et al.  A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives , 2016, IEEE Transactions on Evolutionary Computation.

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

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

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

[13]  Hisao Ishibuchi,et al.  Review of coevolutionary developments of evolutionary multi-objective and many-objective algorithms and test problems , 2014, 2014 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making (MCDM).

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

[15]  Andrzej Jaszkiewicz,et al.  Genetic local search for multi-objective combinatorial optimization , 2022 .

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

[17]  Andrzej Jaszkiewicz,et al.  On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment , 2002, IEEE Trans. Evol. Comput..

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

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

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