2020
DOI: 10.1016/j.engappai.2020.103479
|View full text |Cite
|
Sign up to set email alerts
|

Differential Evolution: A review of more than two decades of research

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
119
0
3

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
2
2

Relationship

0
10

Authors

Journals

citations
Cited by 492 publications
(122 citation statements)
references
References 220 publications
0
119
0
3
Order By: Relevance
“…DE is a simple yet powerful population-based global searching algorithm for solving various optimization problems over continuous spaces. However, there are two main defects in DE, premature convergence and stagnation [19,29,30]. The improvement of previous studies mainly focuses on the following four aspects: control parameter settings [31][32][33], strategy selection [34][35][36], population topology [37,38] and mixing with other optimization algorithms [39,40].…”
Section: Inverse Design Of Multilayer Nanofilms With De-bp Methodsmentioning
confidence: 99%
“…DE is a simple yet powerful population-based global searching algorithm for solving various optimization problems over continuous spaces. However, there are two main defects in DE, premature convergence and stagnation [19,29,30]. The improvement of previous studies mainly focuses on the following four aspects: control parameter settings [31][32][33], strategy selection [34][35][36], population topology [37,38] and mixing with other optimization algorithms [39,40].…”
Section: Inverse Design Of Multilayer Nanofilms With De-bp Methodsmentioning
confidence: 99%
“…We integrate model in Equation (9) by classic Runge Kutta scheme and solve the optimization stage with the so-called Differntial Evolution method. Differential Evolution (DE) [22] is an evolutionary algorithm successfully employed for global optimization [23]. The method is designed to optimize functions f : ℝ n → ℝ.…”
Section: Numerical Experimentsmentioning
confidence: 99%
“…Şekil 4'te görüldüğü gibi DE algoritmasında yeni bir popülasyon oluşturmak için, mutasyon, çaprazlama ve seçim döngüsü her yinelemede birey sayısı (Np) kadar tekrarlanır (Bilal et al, 2020). Bu işlem önceden belirlenen durma koşulu sağlanıncaya kadar devam ettirilir.…”
Section: Farksal Gelişim Algoritmasıunclassified