A Symmetric Sine Cosine Algorithm With Adaptive Probability Selection

To improve the ability of the sine cosine algorithm (SCA) in the exploitation process, an improved symmetric SCA with adaptive probability selection (SSCA-APS), is proposed. The search process of this algorithm is divided into early and late stages. In the early stage, the operators of the traditional SCA algorithm continue to be used. In the late stage, three improvements were applied. Firstly, the symmetric sine and cosine operators are proposed. The adaptive probability selection strategy is adopted to integrate original sine and cosine operators and symmetric sine and cosine operators for dynamically adjusting the step size of the search range. Furthermore, to prevent the population from falling into local optimization, Gaussian perturbation is used to mutate the globally optimal individuals of the current generation. In addition, the information of two randomly selected individuals and the globally optimal individual is integrated by quadratic interpolation to maintain population diversity and produce a new individual. 23 test functions were used to verify the performance of the proposed algorithm. The simulation results indicate that the performance of the SSCA-APS algorithm has competitiveness when it is compared with classical SCA and some state-of-the-art SCA variants.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.