A Chaotic Artificial Bee Colony Algorithm Based on Lévy Search

Abstract

The invention relates to a chaotic artificial bee colony algorithm based on Levy search. The algorithm introduces the chaos theory and the Levy flight theory, and is a new artificial bee colony algorithm. The chaos theory is used for the initialization of a solution, thereby speeding up the convergence of the algorithm. A global optimal solution guide strategy is added at the stage of employed beeoptimization, thereby improving the search capability of the algorithm. The Levy flight strategy is added at the stage of following bees so as to jump out of the local optical solution, thereby enabling the algorithm to balance the global and local optimization capabilities, and improving the precision of an optimal solution.