Chaos in popular metaheuristic optimizers–a bibliographic analysis

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

Abstract

This paper presents an overview of the history and recent efforts in combining chaos theory and evolutionary computation techniques. Various algorithms from the evolutionary computation domain, also known as metaheuristic algorithms, have been successfully enhanced with chaotic components in the past. Numerous ways to incorporate chaos have been examined, and many impressive results have been reported. Implementations of discrete chaotic maps such as Lozi, Hénon, and logistic map as generators of chaotic pseudo-random sequences for controlling evolution operators in metaheuristics have achieved significant popularity. In this survey, we focus on the research field itself and perform a bibliographical analysis to show how broad and active is nowadays the research field of chaos-enhanced metaheuristics and what are some of the most recent works published.

Cite

CITATION STYLE

APA

Pluhacek, M., Kazikova, A., Viktorin, A., Kadavy, T., & Senkerik, R. (2023). Chaos in popular metaheuristic optimizers–a bibliographic analysis. Journal of Difference Equations and Applications, 29(9–12), 1228–1243. https://doi.org/10.1080/10236198.2023.2203779

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