An Artificial Bee Colony Algorithm with History-Driven Scout Bees Phase

摘要

The scout bees phase of artificial bee colony (ABC) algorithm emulates a random restart and cannot make sure the quality of the solution generated. Thus, we propose to use the entire search history to improve the quality of regenerated solutions, called history-driven scout bee ABC (HdABC). The proposed algorithm has been tested on a set of 28 test functions. Experimental results show that ABC cannot significantly outperforms HdABC on all functions; while HdABC significantly outperforms ABC in most test cases. Moreover, when the number of restarts increases, the performance of HdABC improves.