A novel adaptive sparrow search algorithm based on chaotic mapping and t-distribution mutation

Abstract

Aiming at the problems of the basic sparrow search algorithm (SSA) in terms of slow convergence speed and the ease of falling into the local optimum, the chaotic mapping strategy, adaptive weighting strategy and t-distribution mutation strategy are introduced to develop a novel adaptive sparrow search algorithm, namely the CWTSSA in this paper. In the proposed CWTSSA, the chaotic mapping strategy is employed to initialize the population in order to enhance the population diversity. The adaptive weighting strategy is applied to balance the capabilities of local mining and global exploration, and improve the convergence speed. An adaptive t-distribution mutation oper-ator is designed, which uses the iteration number t as the degree of freedom parameter of the t- distribution to improve the characteristic of global exploration and local exploration abilities, so as to avoid falling into the local optimum. In order to prove the effectiveness of the CWTSSA, 15 stand-ard test functions and other improved SSAs, differential evolution (DE), particle swarm optimization (PSO), gray wolf optimization (GWO) are selected here. The compared experiment results in-dicate that the proposed CWTSSA can obtain higher convergence accuracy, faster convergence speed, better diversity and exploration abilities. It provides a new optimization algorithm for solv-ing complex optimization problems.