`` Direct Search'' Solution of Numerical and Statistical Problems
Journal of the ACM (JACM)
Hi-index | 0.00 |
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.