An efficient surrogate-assisted hybrid optimization algorithm for expensive optimization problems

被引:109
作者
Pan, Jeng-Shyang [1 ,2 ]
Liu, Nengxian [2 ]
Chu, Shu-Chuan [1 ]
Lai, Taotao [3 ]
机构
[1] Shandong Univ Sci & Technol, Coll Comp Sci & Engn, Qingdao, Peoples R China
[2] Fuzhou Univ, Coll Math & Comp Sci, Fuzhou, Peoples R China
[3] Minjiang Univ, Coll Comp & Control Engn, Fuzhou, Peoples R China
基金
中国国家自然科学基金;
关键词
Surrogate-assisted; Hybrid optimization algorithm; Teaching-learning-based optimization; Differential evolution; Expensive problems; PARTICLE SWARM OPTIMIZATION; EVOLUTIONARY OPTIMIZATION; DIFFERENTIAL EVOLUTION; STRATEGY;
D O I
10.1016/j.ins.2020.11.056
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Surrogate-assisted evolutionary algorithms (SAEAs) are potential approaches to solve computationally expensive optimization problems. The critical idea of SAEAs is to combine the powerful searching capabilities of evolutionary algorithms with the predictive capabilities of surrogate models. In this study, an efficient surrogate-assisted hybrid optimization (SAHO) algorithm is proposed via combining two famous algorithms, namely, teaching-learning-based optimization (TLBO) and differential evolution (DE). The TLBO is focused on global exploration and the DE is concentrated on local exploitation. These two algorithms are carried out alternately when no better candidate solution can be found. Meanwhile, a new prescreening criterion based on the best and top collection information is introduced to choose promising candidates for real function evaluations. Besides, two evolution control (i.e., the generation-based and individual-based) strategies and a top-ranked restart strategy are integrated in the SAHO. Moreover, a local RBF surrogate which does not need too many training samples is employed to model the landscapes of the target function. Sixteen benchmark functions and the tension/compression spring design problem are adopted to compare the proposed SAHO with other state-of-the-art approaches. Extensive comparison results demonstrate that the proposed SAHO has superior performance for solving expensive optimization problems. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:304 / 325
页数:22
相关论文
共 50 条
[1]   An adaptive gradient descent-based local search in memetic algorithm applied to optimal controller design [J].
Arab, Aliasghar ;
Alfi, Alireza .
INFORMATION SCIENCES, 2015, 299 :117-142
[2]  
Awad NH., 2017, PROBLEM DEFINITIONS
[3]   A STUDY OF MATHEMATICAL-PROGRAMMING METHODS FOR STRUCTURAL OPTIMIZATION .1. THEORY [J].
BELEGUNDU, AD ;
ARORA, JS .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1985, 21 (09) :1583-1599
[4]   An efficient surrogate-assisted particle swarm optimization algorithm for high-dimensional expensive problems [J].
Cai, Xiwen ;
Qiu, Haobo ;
Gao, Liang ;
Jiang, Chen ;
Shao, Xinyu .
KNOWLEDGE-BASED SYSTEMS, 2019, 184
[5]   Recent trends in the use of statistical tests for comparing swarm and evolutionary computing algorithms: Practical guidelines and a critical review [J].
Carrasco, J. ;
Garcia, S. ;
Rueda, M. M. ;
Das, S. ;
Herrera, F. .
SWARM AND EVOLUTIONARY COMPUTATION, 2020, 54
[6]   Gaussian quantum-behaved particle swarm optimization approaches for constrained engineering design problems [J].
Coelho, Leandro dos Santos .
EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (02) :1676-1683
[7]   Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art [J].
Coello, CAC .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2002, 191 (11-12) :1245-1287
[8]   Recent advances in differential evolution - An updated survey [J].
Das, Swagatam ;
Mullick, Sankha Subhra ;
Suganthan, P. N. .
SWARM AND EVOLUTIONARY COMPUTATION, 2016, 27 :1-30
[9]  
Di Nuovo Alessandro G., 2012, Parallel Problem Solving from Nature - PPSN XII. Proceedings of the 12th International Conference, P102, DOI 10.1007/978-3-642-32964-7_11
[10]   Comparison of metamodeling techniques in evolutionary algorithms [J].
Diaz-Manriquez, Alan ;
Toscano, Gregorio ;
Coello Coello, Carlos A. .
SOFT COMPUTING, 2017, 21 (19) :5647-5663