 A review of chaos-based firefly algorithms: Perspectives and research challengesIztok Fister, Matjaž Perc, Salahuddin M. Kamal and Iztok Fister Applied Mathematics and Computation, 2015, vol. 252, issue C, 155-165 Abstract: The firefly algorithm is a member of the swarm intelligence family of algorithms, which have recently showed impressive performances in solving optimization problems. The firefly algorithm, in particular, is applied for solving continuous and discrete optimization problems. In order to tackle different optimization problems efficiently and fast, many variants of the firefly algorithm have recently been developed. Very promising firefly versions use also chaotic maps in order to improve the randomness when generating new solutions and thereby increasing the diversity of the population. The aim of this review is to present a concise but comprehensive overview of firefly algorithms that are enhanced with chaotic maps, to describe in detail the advantages and pitfalls of the many different chaotic maps, as well as to outline promising avenues and open problems for future research. Keywords: Firefly algorithm; Chaos; Chaotic map; Optimization; Swarm intelligence (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:252:y:2015:i:c:p:155-165 DOI: 10.1016/j.amc.2014.12.006 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.