An Improved Ideal Point Setting in Multiobjective Evolutionary Algorithm Based on Decomposition

In this paper, we propose an improved ideal point setting method in the framework of MOEA/D. MOEA/D decomposes a multi-objective optimisation problem into a number of scalar optimisation problems and optimise them simultaneously. The performance of MOEA/D is highly relate to its decomposition method, and the proposed ideal point setting approach is used in the weighted Tchebycheff (TCH) and penalty-based boundary intersection (PBI) decomposition approach. It expands the region of search in the objective space by transforming the original ideal point into its symmetric point and changes the search direction of each subproblems in MOEA/D. In order to address the proposed ideal point setting method, we design a set of multi-objective problems(MOPs). The proposed method is compared with original MOEA/D-TCH and MOEA/D-PBI on MOPs. The experimental results demonstrate that our proposed ideal point setting method is very effective in terms of both diversity and convergence.

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

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

[3]  Lothar Thiele,et al.  A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers , 2006 .

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

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

[6]  Kalyanmoy Deb,et al.  Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems , 1999, Evolutionary Computation.

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

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

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

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

[11]  Yuping Wang,et al.  Multiobjective programming using uniform design and genetic algorithm , 2000, IEEE Trans. Syst. Man Cybern. Part C.

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

[13]  Martin J. Oates,et al.  PESA-II: region-based selection in evolutionary multiobjective optimization , 2001 .

[14]  Dirk Thierens,et al.  The balance between proximity and diversity in multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[15]  Junichi Suzuki,et al.  R2-IBEA: R2 indicator based evolutionary algorithm for multiobjective optimization , 2013, 2013 IEEE Congress on Evolutionary Computation.

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

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

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

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

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