Decomposition-Based Multiobjective Evolutionary Algorithm With Genetically Hybrid Differential Evolution Strategy

被引:5
作者
Luo, Naili [1 ,2 ]
Lin, Wu [1 ]
Jin, Genmiao [1 ]
Jiang, Changkun [1 ]
Chen, Jianyong [1 ]
机构
[1] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China
[2] Shenzhen Univ, Coll Optoelect Engn, Shenzhen 518060, Peoples R China
基金
中国国家自然科学基金;
关键词
Multiobjective optimization; decomposition; recombination operator; differential evolution;
D O I
10.1109/ACCESS.2020.3047699
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the decomposition-based multiobjective evolutionary algorithms (MOEA/Ds), a set of subproblems are optimized by using the evolutionary search to exploit the feasible regions. In recent studies of MOEA/Ds, it was found that the design of recombination operators would significantly affect their performances. Therefore, this paper proposes a novel genetically hybrid differential evolution strategy (GHDE) for recombination in MOEA/Ds, which works effectively to strengthen the search capability. Inspired by the existing studies of recombination operators in MOEA/Ds, two composite operator pools are introduced, each of which includes two distinct differential evolution (DE) mutation strategies, one emphasizing convergence and the other focusing on diversity. Regarding each selected operator pool, two DEs are applied on parents' genes to hybridize offspring by adaptive parameters tuning. Moreover, a fitness-rate-rank-based multiarmed bandit (FRRMAB) is embedded into our algorithm to select the best operator pool by collecting their recently achieved fitness improvement rates. After embedding GHDE into an MOEA/D variant with dynamical resource allocation, a variant named MOEA/D-GHDE is presented. Various test multiobjective optimization problems (MOPs), i.e., UF, F test suites, and MOPs with difficult-to-approximate (DtA) PF boundaries, are used to assess performances. Compared to several competitive MOEA/D variants, the comprehensive experiments validate the superiority of our algorithm.
引用
收藏
页码:2428 / 2442
页数:15
相关论文
共 55 条
[1]   KEEL: a software tool to assess evolutionary algorithms for data mining problems [J].
Alcala-Fdez, J. ;
Sanchez, L. ;
Garcia, S. ;
del Jesus, M. J. ;
Ventura, S. ;
Garrell, J. M. ;
Otero, J. ;
Romero, C. ;
Bacardit, J. ;
Rivas, V. M. ;
Fernandez, J. C. ;
Herrera, F. .
SOFT COMPUTING, 2009, 13 (03) :307-318
[2]   An Effective Hybrid Butterfly Optimization Algorithm with Artificial Bee Colony for Numerical Optimization [J].
Arora, Sankalap ;
Singh, Satvir .
INTERNATIONAL JOURNAL OF INTERACTIVE MULTIMEDIA AND ARTIFICIAL INTELLIGENCE, 2017, 4 (04) :14-21
[3]   SMS-EMOA: Multiobjective selection based on dominated hypervolume [J].
Beume, Nicola ;
Naujoks, Boris ;
Emmerich, Michael .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (03) :1653-1669
[4]  
Camacho Auraham, 2019, Evolutionary Multi-Criterion Optimization. 10th International Conference, EMO 2019. Proceedings: Lecture Notes in Computer Science (LNCS 11411), P216, DOI 10.1007/978-3-030-12598-1_18
[5]   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
[6]  
Coello C.A.C., 2007, EVOLUTIONARY ALGORIT
[7]   An improvement decomposition-based multi-objective evolutionary algorithm with uniform design [J].
Dai, Cai ;
Lei, Xiujuan .
KNOWLEDGE-BASED SYSTEMS, 2017, 125 :108-115
[8]   Differential Evolution: A Survey of the State-of-the-Art [J].
Das, Swagatam ;
Suganthan, Ponnuthurai Nagaratnam .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (01) :4-31
[9]   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
[10]  
Deb K., 1995, Complex Systems, V9, P115