Parallelization of the artificial bee colony (ABC) algorithm

In this paper modifications to the Artificial Bee Colony algorithm are proposed that introduce parallelization of the standard ABC algorithm. The ABC algorithm was successfully used on many optimization problems. Parallelization allows not only for faster execution since multicore processors can be better utilized, but also for better performance since search algorithm is changed. Different threads are assigned to separate swarms and different types of communications among these swarms are proposed and examined. This communication among swarms allows additional tuning of the exploitation and exploration ratio. Standard benchmark functions that are used in the literature were tested and results proved this approach to be superior.