A generation-based optimal restart strategy for surrogate-assisted social learning particle swarm optimization

被引:81
作者
Yu, Haibo [1 ]
Tan, Ying [2 ]
Sun, Chaoli [2 ]
Zeng, Jianchao [1 ,3 ]
机构
[1] Taiyuan Univ Sci & Technol, Dept Mech Engn, Taiyuan 030024, Shanxi, Peoples R China
[2] Taiyuan Univ Sci & Technol, Dept Comp Sci & Technol, Taiyuan 030024, Shanxi, Peoples R China
[3] North Univ China, Inst Big Data & Visual Comp, Taiyuan 030051, Shanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Surrogate; Radial basis function; Particle swarm optimization; Model management; Expensive optimization; GLOBAL OPTIMIZATION; EVOLUTIONARY OPTIMIZATION; METAMODELING TECHNIQUES; DESIGN; ALGORITHMS; SUPPORT; TESTS;
D O I
10.1016/j.knosys.2018.08.010
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Evolutionary algorithm provides a powerful tool to the solution of modern complex engineering optimization problems. In general, a great deal of evaluation effort often requires to be made in evolutionary optimization to locate a reasonable optimum. This poses a serious challenge to extend its application to computationally expensive problems. To alleviate this difficulty, surrogate-assisted evolutionary algorithms (SAEAs) have drawn great attention over the past decades. However, in order to ensure the performance of SAEAs, the use of appropriate model management is indispensable. This paper proposes a generation-based optimal restart strategy for a surrogate-assisted social learning particle swarm optimization (SL-PSO). In the proposed method, the SL-PSO restarts every few generations in the global radial-basis-function model landscape, and the best sample points archived in the database are employed to reinitialize the swarm at each restart. Promising individual with the best estimated fitness value is chosen for exact evaluation before each restart of the SL-PSO. The proposed method skillfully integrates the restart strategy, generation-based and individual-based model managements into a whole, whilst those three ingredients coordinate with each other, thus offering a powerful optimizer for the computationally expensive problems. To assess the performance of the proposed method, comprehensive experiments are conducted on a benchmark test suit of dimensions ranging from 10 to 100. Experimental results demonstrate that the proposed method shows superior performance in comparison with four state-of-the-art algorithms in a majority of benchmarks when only a limited computational budget is available. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:14 / 25
页数:12
相关论文
共 59 条
[1]  
[Anonymous], RADIAL BASIS FUNCTIO
[2]  
[Anonymous], 2017, IEEE ICC
[3]  
[Anonymous], 2017, IEEE T VEH TECHNOL
[4]  
[Anonymous], STRUCT MULTIDISCIP O
[5]  
[Anonymous], 2005, PROBLEM DEFINITIONS
[6]  
[Anonymous], 1995, 1995 IEEE INT C
[7]  
[Anonymous], PERFORMANCE COMP MET
[8]   Accelerating evolutionary algorithms with Gaussian process fitness function models [J].
Büche, D ;
Schraudolph, NN ;
Koumoutsakos, P .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2005, 35 (02) :183-194
[9]   A multi-point sampling method based on kriging for global optimization [J].
Cai, Xiwen ;
Qiu, Haobo ;
Gao, Liang ;
Yang, Peng ;
Shao, Xinyu .
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2017, 56 (01) :71-88
[10]   Measuring the curse of dimensionality and its effects on particle swarm optimization and differential evolution [J].
Chen, Stephen ;
Montgomery, James ;
Bolufe-Roehler, Antonio .
APPLIED INTELLIGENCE, 2015, 42 (03) :514-526