2015
DOI: 10.1007/978-3-319-27400-3_8
|View full text |Cite
|
Sign up to set email alerts
|

Aesthetic Differential Evolution Algorithm for Solving Computationally Expensive Optimization Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…In Mutation, the algorithm selects three vectors out of the population randomly then use one of three schemes defined in DE, DE/rand/bin is one of the popular schemes, to produce a new sample vector (the tweaked vector) [7]. While the Crossover takes that new sample from the Mutation as an input and uses some tweaking on its values [7].…”
Section: Differential Evaluation a Basic Differential Evaluationmentioning
confidence: 99%
See 1 more Smart Citation
“…In Mutation, the algorithm selects three vectors out of the population randomly then use one of three schemes defined in DE, DE/rand/bin is one of the popular schemes, to produce a new sample vector (the tweaked vector) [7]. While the Crossover takes that new sample from the Mutation as an input and uses some tweaking on its values [7].…”
Section: Differential Evaluation a Basic Differential Evaluationmentioning
confidence: 99%
“…While the Crossover takes that new sample from the Mutation as an input and uses some tweaking on its values [7]. The Mutation operation controlled by an amplification weight factor (a vector lies between 1 and 0).…”
Section: Differential Evaluation a Basic Differential Evaluationmentioning
confidence: 99%