Multi-phase ensemble-RBF-assisted differential evolution for high-dimensional expensive optimization.
Saved in:
| Title: | Multi-phase ensemble-RBF-assisted differential evolution for high-dimensional expensive optimization. |
|---|---|
| Authors: | Ilchi Ghazaan, Majid1 (AUTHOR) ilchi@iust.ac.ir, Mirghazanfari, Parnian1 (AUTHOR) |
| Source: | Cluster Computing. Nov2025, Vol. 28 Issue 12, p1-28. 28p. |
| Subject Terms: | *RADIAL basis functions, *DIFFERENTIAL evolution, *SURROGATE-based optimization, *OPTIMIZATION algorithms, *MATHEMATICAL programming, *MATHEMATICAL optimization, *UNCERTAINTY (Information theory) |
| Abstract: | Surrogate-assisted evolutionary algorithms (SAEAs) are gaining attention for solving computationally expensive optimization problems, especially in high dimensions where traditional methods struggle. However, their effectiveness often diminishes as dimensionality increases due to challenges in maintaining accurate surrogate models. This research presents the multi-phase ensemble radial basis function assisted differential evolution (MERADE) algorithm, an innovative and efficient approach designed to address these challenges. MERADE utilizes an ensemble of Radial Basis Function (RBF) models, trained through a hybrid strategy that combines K-means clustering and Latin Hypercube Sampling (LHS) for center selection. These ensemble RBFs, constructed in parallel during the global prescreening phase, significantly reduce computational time and provide uncertainty estimates, enhancing the reliability of candidate solution selection. By leveraging uncertainty, MERADE ensures a balance between exploration and exploitation. Furthermore, MERADE incorporates global, semi-local, and local search phases, selectively applied at different iterations to improve convergence. The algorithm also features adaptive adjustments to the Differential Evolution (DE) parameters, specifically tuned to enhance the prescreening phase and avoid local minima. Experimental results on several benchmark functions across multiple dimensions (20D, 30D, 50D, and 100D), totaling thirty-one tests, demonstrate that MERADE achieves faster convergence and significantly reduced computational time compared to several state-of-the-art algorithms, providing an efficient solution for high-dimensional optimization problems. [ABSTRACT FROM AUTHOR] |
| Database: | Academic Search Index |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstract: | Surrogate-assisted evolutionary algorithms (SAEAs) are gaining attention for solving computationally expensive optimization problems, especially in high dimensions where traditional methods struggle. However, their effectiveness often diminishes as dimensionality increases due to challenges in maintaining accurate surrogate models. This research presents the multi-phase ensemble radial basis function assisted differential evolution (MERADE) algorithm, an innovative and efficient approach designed to address these challenges. MERADE utilizes an ensemble of Radial Basis Function (RBF) models, trained through a hybrid strategy that combines K-means clustering and Latin Hypercube Sampling (LHS) for center selection. These ensemble RBFs, constructed in parallel during the global prescreening phase, significantly reduce computational time and provide uncertainty estimates, enhancing the reliability of candidate solution selection. By leveraging uncertainty, MERADE ensures a balance between exploration and exploitation. Furthermore, MERADE incorporates global, semi-local, and local search phases, selectively applied at different iterations to improve convergence. The algorithm also features adaptive adjustments to the Differential Evolution (DE) parameters, specifically tuned to enhance the prescreening phase and avoid local minima. Experimental results on several benchmark functions across multiple dimensions (20D, 30D, 50D, and 100D), totaling thirty-one tests, demonstrate that MERADE achieves faster convergence and significantly reduced computational time compared to several state-of-the-art algorithms, providing an efficient solution for high-dimensional optimization problems. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 13867857 |
| DOI: | 10.1007/s10586-025-05459-x |