A surrogate-assisted evolutionary algorithm with clustering-based sampling for high-dimensional expensive blackbox optimization

Abstract

Many practical problems involve the optimization of computationally expensive blackbox functions. The computational cost resulting from expensive function evaluations considerably limits the number of true objective function evaluations allowed in order to find a good solution. In this paper, we propose a clustering-based surrogate-assisted evolutionary algorithm, in which a clustering-based local search technique is embedded into the radial basis function surrogate-assisted evolutionary algorithm framework to obtain sample points which might be close to the local solutions of the actual optimization problem. The algorithm generates sample points cyclically by the clustering-based local search, which takes the cluster centers of the ultimate population obtained by the differential evolution iterations applied to the surrogate model in one cycle as new sample points, and these new sample points are added into the initial population for the differential evolution iterations of the next cycle. In this way the exploration and the exploitation are better balanced during the search process. To verify the effectiveness of the present algorithm, it is compared with four state-of-the-art surrogate-assisted evolutionary algorithms on 24 synthetic test problems and one application problem. Experimental results show that the present algorithm outperforms other algorithms on most synthetic test problems and the application problem.