.png){kind=icon}
Return
Multi-search differential evolution algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-016-0885-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The differential evolution algorithm (DE) has been shown to be a very simple and effective evolutionary algorithm. Recently, DE has been successfully used for the numerical optimization. In this paper, first, based on the fitness value of each individual, the population is partitioned into three subpopulations with different size. Then, a dynamically adjusting method is used to change the three subpopulation group sizes based on the previous successful rate of different mutation strategies. Second, inspired by the DE/current to pbest/1, three mutation strategies including DE/current to cbest/1, DE/current to rbest/1 and DE/current to fbest/1 are proposed to take on the responsibility for either exploitation or exploration. Finally, a novel effective parameter adaptation method is designed to automatically tune the parameter F and CR in DE algorithm. In order to validate the effectiveness of MSDE, it is tested on ten benchmark functions chosen from literature. Compared with some evolution algorithms from literature, MSDE performs better in most of the benchmark problems.
Keywords:
Multiple sub-populations
Differential evolution
Adaptive parameter control
Global optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSave
ShareSaveComprehensive learning particle swarm optimizer for global optimization of multimodal functions
PREAI
ShareSaveShareSave
View more