Christian Camacho

Christian Camacho
Université Libre de Bruxelles | ULB · Artificial Intelligence Research Laboratory of the Université Libre de Bruxelles (IRIDIA)

About

9
Publications
3,971
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
357
Citations

Publications

Publications (9)
Article
We present a rigorous, component‐based analysis of six widespread metaphor‐based algorithms for tackling continuous optimization problems. In addition to deconstructing the six algorithms into their components and relating them with equivalent components proposed in well‐established techniques, such as particle swarm optimization and evolutionary a...
Article
It has been more than 10 years since the first version of cuckoo search was proposed by Yang and Deb and published in the proceedings of the World Congress on Nature & Biologically Inspired Computing, in 2009. The two main articles on cuckoo search have now been cited almost 8 700 times (according to Google scholar), there are books and chapters pu...
Article
Full-text available
The particle swarm optimization (PSO) algorithm has been the object of many studies and modifications for more than twentyfive years. Ranging from small refinements to the incorporation of sophisticated novel ideas, the majority of modifications proposed to this algorithm have been the result of a manual process in which developers try new designs...
Chapter
In this paper, we carry out a review of the grey wolf, the firefly and the bat algorithms. We identify the concepts involved in these three metaphor-based algorithms and compare them to those proposed in the context of particle swarm optimization. We provide compelling evidence that the grey wolf, the firefly, and the bat algorithms are not novel,...
Article
Full-text available
In this article, we rigorously analyze the intelligent water drops (IWD) algorithm, a metaphor-based approach for the approximate solution of discrete optimization problems proposed by Shah-Hosseini (in: Proceedings of the 2007 congress on evolutionary computation (CEC 2007), IEEE Press, Piscataway, NJ, pp 3226–3231, 2007). We demonstrate that all...

Network

Cited By