An ABC algorithm with inversely proportional mutation

Abstract

Artificial bee colony (ABC) algorithm has been very popular in the last few years in computational intelligence research area. This paper proposes a modified version of the ABC algorithm for solving numerical function optimization problems. The purpose of this modified ABC algorithm is to improve the exploitation capability of the ABC algorithm. For this purpose, the proposed ABC uses an inversely proportional mutation function and a new search mechanism. Experiments are performed on a set of 9 widely used benchmark problems. The experimental results show that this modified ABC algorithm outperforms the standard ABC algorithm.