.png){kind=icon}
Return
An improved differential evolution algorithm with triangular mutation for global numerical optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2015.04.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an Improved Differential Evolution (IDE) algorithm for solving global numerical optimization problems over continuous space. The proposed algorithm introduces a new triangular mutation rule based on the convex combination vector of the triplet defined by the three randomly chosen vectors and the difference vector between the best and the worst individuals among the three randomly selected vectors. The mutation rule is combined with the basic mutation strategy through a non-linear decreasing probability rule. Furthermore, a restart mechanism is also proposed to avoid premature convergence. IDE is tested on a well-known set of unconstrained problems and shows its superiority to state-of-the-art differential evolution variants. (C) 2015 Elsevier Ltd. All rights reserved.
Keywords:
Evolutionary computation
Global optimization
Differential evolution
Triangular mutation
Dynamic non-linear crossover
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:
1.0W
Citations:
3.8W
Organization
Cited Papers
ShareSaveMultilocus genotyping of Giardia duodenalis in pre-weaned calves with diarrhea in the Republic of Korea.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAIShareSaveShareSaveShareSave
ShareSave
View more