Review and analysis of three components of the differential evolution mutation operator in MOEA/D-DE

被引:0
作者
Ryoji Tanabe
Hisao Ishibuchi
机构
[1] Southern University of Science and Technology,Shenzhen Key Laboratory of Computational Intelligence, University Key Laboratory of Evolving Intelligent Systems of Guangdong Province, Department of Computer Science and Engineering
来源
Soft Computing | 2019年 / 23卷
关键词
Multi-objective optimization; Decomposition-based evolutionary algorithms; Differential evolution operators; Implementation of algorithms;
D O I
暂无
中图分类号
学科分类号
摘要
A decomposition-based multi-objective evolutionary algorithm with a differential evolution variation operator (MOEA/D-DE) shows high performance on challenging multi-objective problems (MOPs). The DE mutation consists of three key components: a mutation strategy, an index selection method for parent individuals, and a bound-handling method. However, the configuration of the DE mutation operator that should be used for MOEA/D-DE has not been thoroughly investigated in the literature. This configuration choice confuses researchers and users of MOEA/D-DE. To address this issue, we present a review of the existing configurations of the DE mutation operator in MOEA/D-DE and systematically examine the influence of each component on the performance of MOEA/D-DE. Our review reveals that the configuration of the DE mutation operator differs depending on the source code of MOEA/D-DE. In our analysis, a total of 30 configurations (three index selection methods, two mutation strategies, and five bound-handling methods) are investigated on 16 MOPs with up to five objectives. Results show that each component significantly affects the performance of MOEA/D-DE. We also present the most suitable configuration of the DE mutation operator, which maximizes the effectiveness of MOEA/D-DE.
引用
收藏
页码:12843 / 12857
页数:14
相关论文
共 89 条
  • [1] Bader J(2011)HypE: an algorithm for fast hypervolume-based many-objective optimization Evol Comput 19 45-76
  • [2] Zitzler E(2007)SMS-EMOA: multiobjective selection based on dominated hypervolume EJOR 181 1653-1669
  • [3] Beume N(2011)Differential evolution: a survey of the state-of-the-art IEEE TEVC 15 4-31
  • [4] Naujoks B(2016)Recent advances in differential evolution—an updated survey Swarm Evol Comput 27 1-30
  • [5] Emmerich MTM(2014)An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints IEEE TEVC 18 577-601
  • [6] Das S(2002)A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE TEVC 6 182-197
  • [7] Suganthan PN(2017)A weighted biobjective transformation technique for locating multiple optimal solutions of nonlinear equation systems IEEE TEVC 21 697-713
  • [8] Das S(2009)A method for handling uncertainty in evolutionary optimization with an application to feedback control of combustion IEEE TEVC 13 180-197
  • [9] Mullick SS(2013)Experimental analysis of bound handling techniques in particle swarm optimization IEEE TEVC 17 259-271
  • [10] Suganthan PN(2006)A review of multiobjective test problems and a scalable test problem toolkit IEEE TEVC 10 477-506