.png){kind=icon}
.png){kind=icon}
Return
Solving Expensive Multimodal Optimization Problem by a Decomposition Differential Evolution Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2021.3113575.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An expensive multimodal optimization problem (EMMOP) is that the computation of the objective function is time consuming and it has multiple global optima. This article proposes a decomposition differential evolution (DE) based on the radial basis function (RBF) for EMMOPs, called D/REM. It mainly consists of two phases: the promising subregions detection (PSD) and the local search phase (LSP). In PSD, a population update strategy is designed and the mean-shift clustering is employed to predict the promising subregions of EMMOP. In LSP, a local RBF surrogate model is constructed for each promising subregion and each local RBF surrogate model tracks a global optimum of EMMOP. In this way, an EMMOP is decomposed into many expensive global optimization subproblems. To handle these subproblems, a popular DE variant, JADE, acts as the search engine to deal with these subproblems. A large number of numerical experiments unambiguously validate that D/REM can solve EMMOPs effectively and efficiently.
Keywords:
Optimization
Statistics
Sociology
Mathematical models
Linear programming
Search problems
Costs
Differential evolution (DE)
expensive multimodal optimization problems (EMMOPs)
radial basis function (RBF)
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W