Abstract:

To prevent the traditional artificial bee colony algorithm from being trapped into premature phenomenon,we propose a novel artificial bee colony algorithm based on dynamic search strategy,in which two different search strategies are combined to produce a new one.We dynamically take the advantages of the two different search strategies,making a balance between the local search ability and the global search ability.Benchmark functions are tested, and the results demonstrate that the new algorithm has fast convergence, high accuracy and more robustness,and is more suitable to solve highdimensional complex global optimization problems.

Key words: artificial bee colony algorithm;dynamic;search strategy