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
相关论文
共 50 条
  • [1] Review and analysis of three components of the differential evolution mutation operator in MOEA/D-DE
    Tanabe, Ryoji
    Ishibuchi, Hisao
    SOFT COMPUTING, 2019, 23 (23) : 12843 - 12857
  • [2] Comparison of Adaptive Differential Evolution Algorithms on the MOEA/D-DE Framework
    Nishihara, Kei
    Nakata, Masaya
    2021 IEEE Congress on Evolutionary Computation, CEC 2021 - Proceedings, 2021, : 161 - 168
  • [3] Comparison of Adaptive Differential Evolution Algorithms on the MOEA/D-DE Framework
    Nishihara, Kei
    Nakata, Masaya
    2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 161 - 168
  • [4] MOEA/D with DE and PSO: MOEA/D-DE plus PSO
    Mashwani, Wali Khan
    RESEARCH AND DEVELOPMENT IN INTELLIGENT SYSTEMS XXVIII: INCORPORATING APPLICATIONS AND INNOVATIONS IN INTELLIGENT SYSTEMS XIX, 2011, : 217 - 221
  • [5] An MOEA/D with Multiple Differential Evolution Mutation Operators
    Li, Yang
    Zhou, Aimin
    Zhang, Guixu
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 397 - 404
  • [6] On the constraint of passive RFID sensor tag design with MOEA/D-DE
    Song, Xiaotian
    Wang, Gang
    Yang, Chenwei
    He, Yuxing
    MICROWAVE AND OPTICAL TECHNOLOGY LETTERS, 2017, 59 (01) : 83 - 86
  • [7] An Enhanced MOEA/D-DE and Its Application to Multiobjective Analog Cell Sizing
    Liu, Bo
    Fernandez, Francisco V.
    Zhang, Qingfu
    Pak, Murat
    Sipahi, Suha
    Gielen, Georges
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [8] A modification to MOEA/D-DE for multiobjective optimization problems with complicated Pareto sets
    Tan, Yan-Yan
    Jiao, Yong-Chang
    Li, Hong
    Wang, Xin-Kuan
    INFORMATION SCIENCES, 2012, 213 : 14 - 38
  • [9] Design of the High-sensitivity RFID Sensor Tag with MOEA/D-DE
    Song, Xiaotian
    Wang, Gang
    He, Yuxing
    2016 INTERNATIONAL SYMPOSIUM ON ANTENNAS AND PROPAGATION (ISAP), 2016, : 950 - 951
  • [10] Optimization of grounding resistance in multitrain DC subway system based on MOEA/D-DE
    Liu, Na
    Du, Guifu
    He, Fei
    Li, Qiaoyue
    Xu, Fengchuan
    Huang, Weiguo
    Jiang, Xingxing
    Zhu, Zhongkui
    IET INTELLIGENT TRANSPORT SYSTEMS, 2023, 17 (08) : 1675 - 1689