L-SHADE-E: Ensemble of two differential evolution algorithms originating from L-SHADE
- Publisher:
- Elsevier BV
- Publication Type:
- Journal Article
- Citation:
- Information Sciences, 2021, 552, pp. 201-219
- Issue Date:
- 2021-04-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 1-s2.0-S0020025520311592-main.pdf | Published version | 1.45 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
For real parameter single objective optimization, Differential Evolution (DE) performs better than other types of population-based metaheuristic. Nevertheless, in the field of DE, it is impossible for a given combination of operators to perform well in all fitness landscapes. Practice has proved that assembling more than one combinations of operators may lead to improvement in solution. However, some DE algorithms with good performance, e.g., one of the best performers in competitions of real parameter single objective optimization among population-based metaheuristics held by the series of IEEE Congress on Evolutionary Computation - L-SHADE-EpSin, are still not involved in ensemble. Furthermore, ensemble based on similar DE algorithms is rarely reported. Based on such a background, we propose L-SHADE-E, ensemble of L-SHADE-EpSin and L-SHADE-RSP in this paper. The two constituent algorithms are both variants of L-SHADE and belong to similar DE algorithms. In our algorithm, L-SHADE-EpSin or L-SHADE-RSP is selected randomly to run at the beginning. If progress on fitness is low for generations, the other constituent algorithm takes over population immediately. Our experiments are based on the CEC 2014 and CEC 2017 benchmark test suites. Altogether, our algorithm is compared with nine DE algorithms and three population-based metaheuristics other than DE. Experimental results show that our algorithm is very competitive.
Please use this identifier to cite or link to this item: