A new artificial bee colony algorithm for numerical optimization

In this paper a new variant of the artificial bee colony algorithm is proposed. It is a known fact that any good optimization algorithm requires a good balance between exploring and exploiting prominent regions of the search space. To this end, several modifications of the artificial bee colony basic algorithm are introduced in the proposed version. The efficiency of the algorithm is evaluated against four other variants of the ABC algorithm using ten standard numerical benchmark functions. The obtained results show that the proposed algorithm has good performances.