TY - GEN
T1 - Radial Basis Function Assisted Optimization Method with Batch Infill Sampling Criterion for Expensive Optimization
AU - Li, Genghui
AU - Zhang, Qingfu
AU - Sun, Jianyong
AU - Han, Zhonghua
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/6
Y1 - 2019/6
N2 - The surrogate-assisted optimization algorithms (SAOAs) are very promising for solving computationally expensive optimization problems (EOPs). Generally, the performance of a SAOA is determined by the quality of its surrogate model and the infill sampling criterion. In this paper, we propose a radial basis function (RBF) assisted optimization algorithm with batch infill sampling criterion for solving EOPs (short for RBFBS). In RBFBS, the quality of RBF model is adjusted by choosing a good shape parameter via solving a sub-expensive hyperparameter optimization problem. Moreover, a batch infill sampling criterion that includes a bi-objective-based sampling approach and a single-objective-based sampling approach is proposed to get a batch of samples for expensive evaluation. The experimental results on various benchmark problems show that RBFBS is very promising for expensive optimization.
AB - The surrogate-assisted optimization algorithms (SAOAs) are very promising for solving computationally expensive optimization problems (EOPs). Generally, the performance of a SAOA is determined by the quality of its surrogate model and the infill sampling criterion. In this paper, we propose a radial basis function (RBF) assisted optimization algorithm with batch infill sampling criterion for solving EOPs (short for RBFBS). In RBFBS, the quality of RBF model is adjusted by choosing a good shape parameter via solving a sub-expensive hyperparameter optimization problem. Moreover, a batch infill sampling criterion that includes a bi-objective-based sampling approach and a single-objective-based sampling approach is proposed to get a batch of samples for expensive evaluation. The experimental results on various benchmark problems show that RBFBS is very promising for expensive optimization.
UR - http://www.scopus.com/inward/record.url?scp=85071319405&partnerID=8YFLogxK
U2 - 10.1109/CEC.2019.8790310
DO - 10.1109/CEC.2019.8790310
M3 - 会议稿件
AN - SCOPUS:85071319405
T3 - 2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings
SP - 1664
EP - 1671
BT - 2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE Congress on Evolutionary Computation, CEC 2019
Y2 - 10 June 2019 through 13 June 2019
ER -