An Improved Method of Artificial Bee Colony Algorithm

摘要

The basic artificial bee colony algorithm gets local extremum easily and converges slowly in optimization problems of the multi-object function. In order to enhance the global search ability of basic artificial bee colony algorithm, an improved method of artificial bee colony algorithm is proposed in this paper. The basic idea of this method is as follows: On the basis of traditional artificial bee colony algorithm, the solution vectors that found by each bee colony are recombined after each iteration, then the solution vectors of combinations are evaluated again, thus the best result is found in this iteration. In this way the possibility of sticking at local extremum is reduced. Finally the simulation experiment has been finished. The simulation experiment results have shown that the method proposed in this paper is feasible and effective, it is better than basic artificial bee colony algorithm in the global search ability.