A surrogate-assisted evolutionary algorithm with knowledge transfer for expensive multimodal optimization problems

被引:8
作者
Du, Wenhao [1 ]
Ren, Zhigang [1 ]
Wang, Jihong [2 ]
Chen, An [1 ]
机构
[1] Xi An Jiao Tong Univ, Sch Automat Sci & Engn, Xian, Peoples R China
[2] Yantai Nanshan Univ, Coll Technol & Data, Yantai, Peoples R China
基金
中国国家自然科学基金;
关键词
Expensive multimodal optimization problems; Modality detection; Surrogate model; Knowledge transfer; Local search; PARTICLE SWARM OPTIMIZATION; DIFFERENTIAL EVOLUTION; STRATEGY; MODEL; COMPUTATION;
D O I
10.1016/j.ins.2023.119745
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As a kind of common problems in practical applications, expensive multimodal optimization problems (EMMOPs) require to locate as many global optima as possible with a few costly or/and time-consuming fitness evaluations. This poses a great challenge since even capturing a single optimum is not so easy. To address this issue, this study proposes a surrogate-assisted multimodal evolutionary algorithm with knowledge transfer (SAKT-MMEA), where a modality prediction method based on global surrogate-assisted sampling (GSSMP) and a joint surrogate-assisted local search method (JSLS) are designed for efficient modality exploration and exploitation, respectively. By pre-constructing a global surrogate model, GSSMP samples and approximately evaluates adequate solutions such that the fitness landscape of an EMMOP can be well depicted and the modalities are expected to be fully detected. For each identified modality, JSLS adaptively takes a local surrogate model or a global one as the objective function to exploit the optimum while preventing it from getting trapped in a local optimum. To further enhance the exploitation efficiency, a knowledge transfer-based optimizer is developed for JSLS to collaboratively perform multiple local search on different modalities. Extensive experimental results on EMMOPs with different features demonstrate that SAKT-MMEA gains competitive edges over six state-of-the-art algorithms.
引用
收藏
页数:24
相关论文
共 50 条
[11]   Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation [J].
Hansen, M ;
Ostermeier, A .
1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, :312-317
[12]  
Hansen Nikolaus., 2016, The CMA evolution strategy: A tutorial
[13]   Harris hawks optimization: Algorithm and applications [J].
Heidari, Ali Asghar ;
Mirjalili, Seyedali ;
Faris, Hossam ;
Aljarah, Ibrahim ;
Mafarja, Majdi ;
Chen, Huiling .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2019, 97 :849-872
[14]   CMA evolution strategy assisted by kriging model and approximate ranking [J].
Huang, Changwu ;
Radi, Bouchaib ;
El Hami, Abdelkhalak ;
Bai, Hao .
APPLIED INTELLIGENCE, 2018, 48 (11) :4288-4304
[15]   Multisurrogate-Assisted Multitasking Particle Swarm Optimization for Expensive Multimodal Problems [J].
Ji, Xinfang ;
Zhang, Yong ;
Gong, Dunwei ;
Sun, Xiaoyan ;
Guo, Yinan .
IEEE TRANSACTIONS ON CYBERNETICS, 2023, 53 (04) :2516-2530
[16]   Dual-Surrogate-Assisted Cooperative Particle Swarm Optimization for Expensive Multimodal Problems [J].
Ji, Xinfang ;
Zhang, Yong ;
Gong, Dunwei ;
Sun, Xiaoyan .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2021, 25 (04) :794-808
[17]   A Surrogate-Assisted Multiswarm Optimization Algorithm for High-Dimensional Computationally Expensive Problems [J].
Li, Fan ;
Cai, Xiwen ;
Gao, Liang ;
Shen, Weiming .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (03) :1390-1402
[18]   Evolutionary Computation for Expensive Optimization: A Survey [J].
Li, Jian-Yu ;
Zhan, Zhi-Hui ;
Zhang, Jun .
MACHINE INTELLIGENCE RESEARCH, 2022, 19 (01) :3-23
[19]   Slime mould algorithm: A new method for stochastic optimization [J].
Li, Shimin ;
Chen, Huiling ;
Wang, Mingjing ;
Heidari, Ali Asghar ;
Mirjalili, Seyedali .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 111 :300-323
[20]  
Li X., 2013, Gene, V7, P8