An Adaptive Lion Swarm Optimization Algorithm Incorporating Tent Chaotic Search and Information Entropy

This paper proposes an improved adaptive lion swarm optimization (LSO) algorithm integrating the chaotic search strategy and information entropy to address the problem that the standard LSO algorithm has slow convergence and easily falls into the local optimum in later iterations. At first, an adaptive factor is introduced to improve tent chaotic mapping and used for population position initialization to enhance population diversity and realize uniform traversal while ensuring random distribution, ultimately improving the global search ability. Second, to address the problem that the cub selection strategy is blind, resulting in insufficient traversal in the early stage, a dynamic step-size perturbation factor is established using the second-order norm and information entropy. Adaptive parameters are used to dynamically adjust the selection probability of different cub behaviors based on the number of iterations to suppress the premature convergence of the algorithm. Finally, tent chaotic search is employed to adaptively adjust the search range and improve the individuals with poor fitness through multiple neighborhood points of the local optimal solution, further improving the algorithm’s search speed and accuracy. Experimental results on 18 benchmark functions revealed that the proposed algorithm yields superior performance in terms of convergence speed, optimization accuracy, and ability to jump out of the local optimal solution compared with the standard LSO, gray wolf optimizer, and particle swarm optimization algorithms. Furthermore, the improved LSO algorithm was used to optimize the initial weights and thresholds of the BP neural network, and the effectiveness of the proposed algorithm was further verified by studying the house price prediction problem using two real-world datasets.