Distance vs. Improvement based parameter adaptation in SHADE

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This work studied a relationship between optimization qualities of Success-History based Adaptive Differential Evolution algorithm (SHADE) and its self-adaptive parameter strategy. Original SHADE with improvement based adaptation is compared to the SHADE with Distance based parameter adaptation (Db_SHADE) on the basis of the CEC2015 benchmark set for continuous optimization and a novel approach combining both distance and improvement adaptation (DIb_SHADE) is presented and tested as a trade-off between both approaches.

Cite

CITATION STYLE

APA

Viktorin, A., Senkerik, R., Pluhacek, M., & Kadavy, T. (2019). Distance vs. Improvement based parameter adaptation in SHADE. In Advances in Intelligent Systems and Computing (Vol. 764, pp. 455–464). Springer Verlag. https://doi.org/10.1007/978-3-319-91189-2_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free