.png){kind=icon}
Return
Kinship-based differential evolution algorithm for unconstrained numerical optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s11071-019-05358-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a modification of the standard differential evolution (DE) algorithm in order to significantly make easier and more efficient standard DE implementations. Taking advantages from chaotic map approaches, recently proposed and successfully implemented for swarm intelligence-based algorithms, our DE improvement facilitates the search for the best population and then the optimal solution. More specifically, we work with a genetic memory that stores parents and grandparents of each individual (its kin) of the population generated by the DE algorithm. In this way, the new population is carried out not only on the basis of the best fitness of a certain individual, but also according to a good score of its kin. Additionally, we carried out a wide numerical campaign in order to assess the performances of our approach and validated the results with standard statistical techniques.
Keywords:
Optimization
Differential evolution algorithm
Chaotic maps
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
Papers:
1.4W
Citations:
4.1W
Organization
Cited Papers
ShareSave
Traffic flow forecasting by seasonal SVR with chaotic simulated annealing algorithm.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSaveShareSaveShareSave
ShareSaveShareSave
View more