2014 IEEE Congress on Evolutionary Computation (CEC) 2014
DOI: 10.1109/cec.2014.6900380
|View full text |Cite
|
Sign up to set email alerts
|

Improving the search performance of SHADE using linear population size reduction

Abstract: Abstract-SHADE is an adaptive DE which incorporates success-history based parameter adaptation and one of the state-of-the-art DE algorithms. This paper proposes L-SHADE, which further extends SHADE with Linear Population Size Reduction (LPSR), which continually decreases the population size according to a linear function. We evaluated the performance of L-SHADE on CEC2014 benchmarks and compared its search performance with state-of-the-art DE algorithms, as well as the state-of-the-art restart CMA-ES variants… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
498
0
7

Year Published

2016
2016
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 989 publications
(583 citation statements)
references
References 24 publications
3
498
0
7
Order By: Relevance
“…Following the methodology described in Tanabe & Fukunaga (2014) we used the Wilcoxon rank-sum test with significance level p < 0.05 to compare the evaluation (Tanabe & Fukunaga, 2014), 3. United Multi-Operator Evolutionary Algorithms (UMOEAs) (Elsayed et al, 2014).…”
Section: Methods Testing On Benchmark Functionsmentioning
confidence: 99%
“…Following the methodology described in Tanabe & Fukunaga (2014) we used the Wilcoxon rank-sum test with significance level p < 0.05 to compare the evaluation (Tanabe & Fukunaga, 2014), 3. United Multi-Operator Evolutionary Algorithms (UMOEAs) (Elsayed et al, 2014).…”
Section: Methods Testing On Benchmark Functionsmentioning
confidence: 99%
“…CoDE [35] combines three well-studied trial vector generation strategies with three random control parameter settings to generate trial vectors. In L-SHADE [36], the Linear Population Size Reduction (LPSR) is embedded into SHADE so that the robustness of the algorithm is improved. Swagatam [37] proposed an improvement mechanism of DE by using the concept of the neighborhood of each population member.…”
Section: Generation Strategy Of Differential Evolutionmentioning
confidence: 99%
“…(1) Test Problems and Dimension Setting: For a comprehensive evaluation of MCPDE, all the CEC2013 [36] benchmark functions are used to evaluate the performance of MCPDE. The CEC2013 benchmark set consists of 28 test functions.…”
Section: General Experimental Settingmentioning
confidence: 99%
“…For convenient description, these functions [19] are denoted as F1-F15, as shown in Table 1. The SPS-L-SHADE-EIG algorithm combines the adaptive differential evolution [20,21] with linear population size reduction(L-SHADE) [22] with the eigenvector-based (EIG) [23] crossover and successful-parent-selecting (SPS) frameworks [24]. The DEsPA algorithm is a new Differential Evolution algorithm with a success-based parameter adaptation with resizing population space [25].…”
Section: Cec 2015 Benchmarksmentioning
confidence: 99%