Clustering Search (*CS) has been proposed as a generic way of combining search metaheuristics with clustering to detect promising search areas before applying local search procedures. The clustering process may keep representative solutions associated to different search subspaces (search areas). In this work, a new approach is proposed, based on Artificial Bee Colony (ABC), observing the inherent characteristics of detecting promissing food sources employed by that metaheuristic. The proposed hybrid algorithm, performing a Hooke & Jeeves based local, is compared against other versions of ABC: A pure ABC and another hybrid ABC, exploring an elitist criteria. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Costa, T. S., & De Oliveira, A. C. M. (2013). Artificial bee clustering search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7903 LNCS, pp. 20–27). https://doi.org/10.1007/978-3-642-38682-4_3
Mendeley helps you to discover research relevant for your work.