Abstract
This article proposes a three-level radial basis function (TLRBF)-assisted optimization algorithm for expensive optimization. It consists of three search procedures at each iteration: 1) the global exploration search is to find a solution by optimizing a global RBF approximation function subject to a distance constraint in the whole search space; 2) the subregion search is to generate a solution by minimizing an RBF approximation function in a subregion determined by fuzzy clustering; and 3) the local exploitation search is to generate a solution by solving a local RBF approximation model in the neighborhood of the current best solution. Compared with some other state-of-the-art algorithms on five commonly used scalable benchmark problems, ten CEC2015 computationally expensive problems, and a real-world airfoil design optimization problem, our proposed algorithm performs well for expensive optimization.
| Original language | English |
|---|---|
| Pages (from-to) | 5720-5731 |
| Journal | IEEE Transactions on Cybernetics |
| Volume | 52 |
| Issue number | 7 |
| Online published | 22 Mar 2021 |
| DOIs | |
| Publication status | Published - Jul 2022 |
Research Keywords
- Computational modeling
- Data models
- Databases
- Expensive optimization
- exploration and exploitation
- Mathematical model
- Optimization
- Predictive models
- radial basis function model (RBF).
- Search problems
Fingerprint
Dive into the research topics of 'A Three-Level Radial Basis Function Method for Expensive Optimization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver