A Hybrid Sparrow Search Algorithm Based on Constructing Similarity

Abstract

Sparrow search algorithm (SSA) is easy to fall into local convergence and convergence stagnation. In order to solve these problems, this paper introduced Circle chaos map into the original SSA to improve its global search ability at the beginning of iteration. Meanwhile, it introduced T-distribution variation to affect the sparrow population position update rules in different iteration periods. Finally, we constructed the “similarity function” to measure the “dispersion” of the sparrow population, and formulated the search rules of the sparrow population under different “dispersion”. In order to test the specific optimization performance of the proposed algorithm, the test results of 54 test functions are compared with those of 9 other algorithms which are widely used, and then the test results are analyzed using non-parametric tests in statistics. At the same time, this paper introduces this algorithm into three concrete engineering test problems for testing. The results of these tests all prove that the proposed algorithm has stronger global optimization ability and higher convergence precision compared with other algorithms.

Keywords

• Sparrow search algorithm
• T-distribution variation
• circle chaotic map
• intrusion detection
• similarity function
• adaptive algorithms