Co-evolving bee colonies by forager migration: A multi-swarm based Artificial Bee Colony algorithm for global search space

摘要

Swarm intelligent algorithms focus on imitating the collective intelligence of a group of simple agents that can work together as a unit. Such algorithms have particularly significant impact in the fields like optimization and artificial intelligence (AI). This research article focus on a recently proposed swarm-based metaheuristic called the Artificial Bee Colony (ABC) algorithm and suggests modification to the algorithmic framework in order to enhance its performance. The proposed ABC variant shall be referred to as Migratory Multi-swarm Artificial Bee Colony (MiMSABC) algorithm. Different perturbation schemes of ABC function differently in varying landscapes. Hence to maintain the basic essence of all these schemes, MiMSABC deploys a multiple swarm populations that are characterized by different and unique perturbation strategies. The concept of reinitializing foragers around a depleted food source using a limiting parameter, as often used conventionally in ABC algorithms, has been avoided. Instead a performance based set of criteria has been introduced to thoroughly detect subpopulations that have shown limited progress to eke out the global optimum. Once failure is detected in a subpopulation provisions have been made so that constituent foragers can migrate to a better performing subpopulation, maintaining, however, a minimum number of members for successful functioning of a subpopulation. To evaluate the performance of the algorithm, we have conducted comparative study involving 8 algorithms for testing the problems on 25 benchmark functions set proposed in the Special Session on IEEE Congress on Evolutionary Competition 2005. Thorough a detailed analysis we have highlighted the statistical superiority of our proposed MiMSABC approach over a set of population based metaheuristics.