Antlion optimizer algorithm based on chaos search and its application

Aiming at the problems of premature convergence and easily fal ing into local optimums of the antlion optimization algo-rithm, a chaos antlion optimization algorithm based on the chaos search is proposed. Firstly, in the algorithm, the population is ini-tialized by using the tent chaotic mapping, and the self-adaptive dynamic adjustment of chaotic search scopes is proposed in order to improve the overal fitness and the optimization efficiency of the population. Then, the tournament strategy is used to select antlions. Final y, the logistic chaos operator is used to optimize the random walk of ants, which forms a global and local paral el search mode with the antlion's foraging behavior. The performance algorithm is tested through 13 complex high-dimensional bench-mark functions and three dimensional path planning problems. The experimental results of six complex high-dimensional benchmark functions show that the presented algorithm has a better conver-gence speed and precision than the standard antlion algorithm and other optimization algorithms, and is suitable for the optimization of complex high dimensional functions. The trajectory planning ex-perimental results show that compared with the antlion optimizer (ALO) algorithm, grey wolf optimizer (GWO), particle swarm op-timization (PSO) and artificial bee colony (ABC) algorithm, it has advantages in speed and accuracy to obtain a specific path, and it is of great value in actual problems.