Artificial bee colony algorithm with multiple onlookers for constrained optimization problems
Miloš Subotić · 2011
In this paper we present a modification of artificial bee colony (ABC) algorithm for constrained optimization problems. In nature more than one onlooker bee goes to a promising food source reported by employed bee. Our proposed modification forms a mutant solution in onlooker phase using three onlookers. This approach obtains better results than the original artificial bee colony algorithm. Our multiple onlooker modified algorithm was tested on the full set of 24 well known benchmark functions known as g-functions and proved to be superior to the pure ABC algorithm in most cases.