Unsupervised Learning Bee Swarm Optimization Metaheuristic
Résumé
In this work, we investigate the use of unsupervised data mining techniques to speed up Bee Swarm Optimization metaheuristic (BSO). Knowledge is extracted dynamically during the search process in order to reduce the number of candidate solutions to be evaluated. One approach uses clustering (for grouping similar solutions) and evaluates only clusters centers considered as representatives. The second uses Frequent itemset mining for guiding the search process to promising solutions. The proposed hybrid algorithms are tested on MaxSAT instances and results show that a significant reduction in time execution can be obtained for large instances while maintaining equivalent quality compared to the original BSO.