A lightweight SHADE-based algorithm for global optimization - liteSHADE

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

Abstract

In this paper, a novel lightweight version of the Successful-History based Adaptive Differential Evolution (SHADE) is presented as the first step towards a simple, user-friendly, metaheuristic algorithm for global optimization. This simplified algorithm is called liteSHADE and is compared to the original SHADE on the CEC2015 benchmark set in three dimensional settings – 10D, 30D and 50D. The results support the idea, that simplification may lead to a successful and understandable algorithm with competitive or even better performance.

Cite

CITATION STYLE

APA

Viktorin, A., Senkerik, R., Pluhacek, M., Kadavy, T., & Jasek, R. (2020). A lightweight SHADE-based algorithm for global optimization - liteSHADE. In Lecture Notes in Electrical Engineering (Vol. 554, pp. 197–206). Springer Verlag. https://doi.org/10.1007/978-3-030-14907-9_20

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