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. (c) 2014 Elsevier Inc. All rights reserved.