Enhancing MOEA/D with information feedback models for large-scale many-objective optimization

被引:162
作者
Zhang, Yin [1 ]
Wang, Gai-Ge [1 ]
Li, Keqin [2 ]
Yeh, Wei-Chang [3 ]
Jian, Muwei [4 ]
Dong, Junyu [1 ]
机构
[1] Ocean Univ China, Dept Comp Sci & Technol, Qingdao 266100, Peoples R China
[2] SUNY Coll New Paltz, Dept Comp Sci, New Paltz, NY 12561 USA
[3] Natl Tsing Hua Univ, Dept Ind Engn & Engn Management, Hsinchu, Taiwan
[4] Shandong Univ Finance & Econ, Sch Comp Sci & Technol, Jinan, Peoples R China
基金
中国国家自然科学基金;
关键词
Benchmark; Decomposition; Evolutionary algorithms; Information feedback models; Many-objective; Multi-objective 0-1 knapsack problem; NONDOMINATED SORTING APPROACH; REFERENCE-POINT; KRILL HERD; ALGORITHM; DECOMPOSITION;
D O I
10.1016/j.ins.2020.02.066
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A multi-objective evolutionary algorithm based on decomposition (MOEA/D) is a classic decomposition-based multi-objective optimization algorithm. In the standard MOEA/D algorithm, the update process of individuals is a forward search process without using the information of previous individuals. However, there is a lot of useful information in the previous iteration. Information Feedback Models (IFM) is a new strategy which can incorporate the information from previous iteration into the updating process. Therefore, this paper proposes a MOEA/D algorithm based on information feedback model, called MOEA/D-IFM. According to the different information feedback models, this paper proposes six variants of MOEA/D, and these algorithms can be divided into two categories according to the way of selecting individuals whether it is random or fixed. At the same time, a new selection strategy has been introduced to further improve the performance of MOEA/DIFM. The experiments were carried out in four aspects. MOEA/D-IFM were compared with other state-of-the-art multi-objective evolutionary algorithms using CEC 2018 problems in two aspects. The best one of the six improved algorithms was chosen to test on large-scale many-objective problems. In addition, we also use MOEA/D-IFM to solve multi-objective backpack problems. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:1 / 16
页数:16
相关论文
共 50 条
[1]   A multi-objective artificial bee colony algorithm [J].
Akbari, Reza ;
Hedayatzadeh, Ramin ;
Ziarati, Koorush ;
Hassanizadeh, Bahareh .
SWARM AND EVOLUTIONARY COMPUTATION, 2012, 2 :39-52
[2]  
[Anonymous], 2018 IEEE C EV COMP
[3]  
[Anonymous], 2001, TIK REP, DOI DOI 10.3929/ETHZ-A-004284029
[4]   A New Local Search-Based Multiobjective Optimization Algorithm [J].
Chen, Bili ;
Zeng, Wenhua ;
Lin, Yangbin ;
Zhang, Defu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (01) :50-73
[5]   A benchmark test suite for evolutionary many-objective optimization [J].
Cheng, Ran ;
Li, Miqing ;
Tian, Ye ;
Zhang, Xingyi ;
Yang, Shengxiang ;
Jin, Yaochu ;
Yao, Xin .
COMPLEX & INTELLIGENT SYSTEMS, 2017, 3 (01) :67-81
[6]   Test Problems for Large-Scale Multiobjective and Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON CYBERNETICS, 2017, 47 (12) :4108-4121
[7]   A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) :773-791
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[10]  
Dorigo M., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1470, DOI 10.1109/CEC.1999.782657