An improved sparrow search algorithm using chaotic opposition‐based learning and hybrid updating rules

Abstract

SummaryMetaheuristic algorithms have special effects in solving optimization problems in real life and have become the focus of researchers. The sparrow search algorithm (SSA) is a newly proposed swarm‐based metaheuristic algorithm that has shown excellent optimization performance. Although compared with other algorithms, SSA shows good performance, the original SSA algorithm still has problems such as weak optimization ability, leading to falling into the local optimum, and being unable to balance exploration and exploitation well. Therefore, this paper proposes an improved SSA using chaotic opposition‐based learning and hybrid updating rules (CHSSA). First, chaotic opposition‐based learning is proposed to improve the diversity of the population. Second, two strategies, including adaptive weights and spiral search, are adopted to update the position. Finally, to evaluate the performance of the proposed CHSSA, this paper uses 23 benchmark functions, IEEE CEC 2017 functions and 4 practical engineering optimization problems to evaluate the algorithm performance. The experimental results show that compared with other advanced optimization algorithms, CHSSA has the characteristics of fast convergence speed, high search accuracy, and strong robustness.