.png){kind=icon}
Return
A clustering-based differential evolution with random-based sampling and Gaussian sampling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2016.04.040.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Differential Evolution (DE) has been widely researched because of its excellent performance and many differential evolution variants have been proposed. However, no variant was able to consistently perform over a wide range of test problems. This paper presents a novel algorithm based on the one-step k-means clustering, random-based sampling and Gaussian sampling to improve the performance of DE to solve optimization problems efficiently. The proposed enhanced DE utilizes the one-step k-means clustering to generate k search spaces. In these spaces, the new mutation operators based on random-based sampling and Gaussian sampling are used to exploit. The resulting algorithms are named as clustering-based differential evolution with random-based sampling and Gaussian sampling (GRCDE). Experimental verifications are conducted on 25 benchmark functions and the CEC'05 competition, including detailed analysis for GRCDE. The results clearly show that GRCDE outperforms other state-of-the-art evolutionary algorithms in terms of the solution accuracy and the convergence rate. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Differential evolution
K-means clustering
Random-based sampling
Gaussian sampling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
ShareSave
View more