Memetic artificial bee colony for integer programming

Abstract

Due to the simplicity of the Artificial Bee Colony (ABC) algorithm, it has been applied to solve a large number of problems. ABC is a stochastic algorithm and it generates trial solutions with random moves, however it suffers from slow convergence. In order to accelerate the convergence of the ABC algorithm, we proposed a new hybrid algorithm, which is called Memetic Artificial Bee Colony for Integer Programming (MABCIP). The proposed algorithm is a hybrid algorithm between the ABC algorithm and a Random Walk with Direction Exploitation (RWDE) as a local search method. MABCIP is tested on 7 benchmark functions and compared with 4 particle swarm optimization algorithms. The numerical results demonstrate that MABCIP is an efficient and robust algorithm.