Adaptive chimp optimization algorithm with chaotic map for global numerical optimization problems

Chimp optimization algorithm (ChOA) is a meta-heuristic algorithm inspired by individual intelligence and sexual motivation during group hunting. It is designed to speed up the convergence of the optimal solution. Because of its simplicity and low computational cost, the algorithm has been widely used to solve complex global optimization problem. But in the process of searching, it is easy to fall into the local optima, and the balance between exploitation and exploration cannot be realized well. In this paper, an adaptive chimp optimization algorithm called AChOA is proposed. Firstly, the Tent chaotic map is firstly used to initialize the chimp population to obtain a better initial solutions and improve convergence precision. Secondly, adaptive non linear convergence factor and adaptive weight are introduced in the global search stage, and the parameters vary adaptively according to the number of iterations and population diversity, so as to improve the population diversity. Thirdly, the Lévy flight strategy is introduced into the position update formula to mitigate the shortcomings of ChOA algorithm, such as finding the local optima rather than the global optima, and lack of balance between the exploitation and exploration process. Finally, a comparison with 10 famous algorithms on 19 benchmark functions of the solving accuracy and convergence speed of AChOA is presented. The results show that AChOA has the advantages of fast convergence speed, high solution accuracy.