An Algorithm for Global Optimization Problems Based on ABC-BFGS

To overcome the problem of premature convergence on Artiifcial Bee Colony (ABC) in optimizing multi modal function, this paper proposed a hybrid algorithm of ABC-BFGS, and used a special mutation to make algorithm escape local minima. Four classic multi-valued functions (Rosen Brock, Rastrigin, Griewank, Ackley) were selected as the test functions. The experimental results show that the ABC-BFGS algorithm not only can effectively locate the global optimum, but also have a rather high convergence speed. The ABC-BFGS algorithm is a promising approach for solving global optimization problems.