Crossover-first differential evolution for improved global optimization in non-uniform search landscapes

Teo, Jason; Hijazi, Mohd Hanafi Ahmad; Lau, Hui Keng; Fattah, Salmah; Baharum, Aslina

doi:10.1007/s13748-015-0061-1

Cited by 1 publication

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…XDE algorithm [1] was recently proposed as an improvement over the original DE algorithm [2,18,19]. It proposes a novel reversal of genetic operations in the original DE algorithm.…”

Section: A Related Materialsmentioning

confidence: 99%

“…In XDE, the crossover operation is first conducted before the mutation operation as follows [1]: i. Crossover: for each parent x G,i , a new vector is created as follows:…”

Section: A Related Materialsmentioning

confidence: 99%

“…where where r1 is randomly chosen from [1,NP], R j is a uniform random [0,1], j rand is random integer [1,D] and i≠r1.…”

Section: A Related Materialsmentioning

confidence: 99%

“…The Crossover-First Differential Evolution (XDE) algorithm was recently introduced as a more efficient optimizer than the original Differential Evolution (DE) algorithm for solving complex, non-linear numerical optimization problems [1][2][3][4]. XDE uses a novel sequence of genetic operations for DE in that the crossover operation is first conducted before the mutation operation.…”

Section: Introductionmentioning

confidence: 99%

“…XDE uses a novel sequence of genetic operations for DE in that the crossover operation is first conducted before the mutation operation. This simple modification introduced in XDE by way of reversing the genetic operations in DE has proven to be highly effective in improving the optimization accuracy of DE, particularly in handling expanded and hybrid composition functions with highly complex search spaces [1].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Analyzing the Scalability Performance of Crossover-First and Self-Adaptive Differential Evolution Algorithms for Complex Numerical Optimization

Teo

2017

International Journal on Advanced Science, Engineering and Information Technology

Self Cite

View full text Add to dashboard Cite

Two Crossover-first Differential Evolution (XDE) algorithms as well as four self-adaptive DE algorithms are compared in this study in terms of their optimization accuracy for solving a set of 15 complex, non-linear numerical optimization functions across 4 different dimensions of 10, 30, 50 and 100 optimization variables. XDE is a crossover-first variant of the original DE algorithm where XjDE is the crossover-first variant of the self-adaptive jDE algorithm. The original DE representing a fixed parameter strategy is tested against four self-adaptive algorithms, namely the DESACR, DESACRF, SDE and jDE algorithms. Although XDE is able to outperform XjDE in all 15 test problems for the lowest dimensional benchmark test setting of 10 variables, the crossover-first approach in XjDE is able to improve its performance and obtained better results over XDE in some of the test problems for the higher-dimensional benchmark test settings of 30, 50 and 100 variables. As such, this shows that there is some merit in adopting the crossover-first approach into the self-adaptive XjDE algorithm since the CR and F parameters are automatically adjusted and optimized by the algorithm itself as compared to the fixed CR and F in XDE which has to be manually tuned by hand. The results also show that different self-adaptive parameter tuning schemes have significantly different effects on the performance of DE as the number of optimization dimensions increases.

show abstract

“…XDE algorithm [1] was recently proposed as an improvement over the original DE algorithm [2,18,19]. It proposes a novel reversal of genetic operations in the original DE algorithm.…”

Section: A Related Materialsmentioning

confidence: 99%

“…In XDE, the crossover operation is first conducted before the mutation operation as follows [1]: i. Crossover: for each parent x G,i , a new vector is created as follows:…”

Section: A Related Materialsmentioning

confidence: 99%

“…where where r1 is randomly chosen from [1,NP], R j is a uniform random [0,1], j rand is random integer [1,D] and i≠r1.…”

Section: A Related Materialsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations