A bi-stage surrogate-assisted hybrid algorithm for expensive optimization problems
Open Access
- 7 February 2021
- journal article
- research article
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 7 (3) , 1391-1405
Abstract
Surrogate-assisted meta-heuristic algorithms have shown good performance to solve the computationally expensive problems within a limited computational resource. Compared to the method that only one surrogate model is utilized, the surrogate ensembles have shown more efficiency to get a good optimal solution. In this paper, we propose a bi-stage surrogate-assisted hybrid algorithm to solve the expensive optimization problems. The framework of the proposed method is composed of two stages. In the first stage, a number of global searches will be conducted in sequence to explore different sub-spaces of the decision space, and the solution with the maximum uncertainty in the final generation of each global search will be evaluated using the exact expensive problems to improve the accuracy of the approximation on corresponding sub-space. In the second stage, the local search is added to exploit the sub-space, where the best position found so far locates, to find a better solution for real expensive evaluation. Furthermore, the local and global searches in the second stage take turns to be conducted to balance the trade-off of the exploration and exploitation. Two different meta-heuristic algorithms are, respectively, utilized for the global and local search. To evaluate the performance of our proposed method, we conduct the experiments on seven benchmark problems, the Lennard–Jones potential problem and a constrained test problem, respectively, and compare with five state-of-the-art methods proposed for solving expensive problems. The experimental results show that our proposed method can obtain better results, especially on high-dimensional problems.Keywords
Funding Information
- National Natural Science Foundation of China (61876123)
- Natural Science Foundation of Shanxi Province (201801D121131)
- Natural Science Foundation of Shanxi Province (201901D111264)
- Natural Science Foundation of Shanxi Province (201901D111262)
This publication has 37 references indexed in Scilit:
- Evolutionary Programming for High-Dimensional Constrained Expensive Black-Box Optimization Using Radial Basis FunctionsIEEE Transactions on Evolutionary Computation, 2013
- A new fitness estimation strategy for particle swarm optimizationInformation Sciences, 2013
- Surrogate-assisted evolutionary computation: Recent advances and future challengesSwarm and Evolutionary Computation, 2011
- Trends, features, and tests of common and recently introduced global optimization methodsEngineering Optimization, 2010
- Predicting rainfall intensity using a genetic algorithm approachHydrological Processes, 2006
- Multiobjective Optimization Using Coupled Response Surface Model and Evolutionary Algorithm.AIAA Journal, 2005
- Smooth Function Approximation Using Neural NetworksIEEE Transactions on Neural Networks, 2005
- Analysis of Support Vector Regression for Approximation of Complex Engineering AnalysesJournal of Mechanical Design, 2004
- Multiobjective evolutionary optimization of the size, shape, and position parameters of radial basis function networks for function approximationIEEE Transactions on Neural Networks, 2003
- Large Sample Properties of Simulations Using Latin Hypercube SamplingTechnometrics, 1987