Cat swarm optimization algorithm based on the information interaction of subgroup and the top-N learning strategy

9Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Because of the lack of interaction between seeking mode cats and tracking mode cats in cat swarm optimization (CSO), its convergence speed and convergence accuracy are affected. An information interaction strategy is designed between seeking mode cats and tracking mode cats to improve the convergence speed of the CSO. To increase the diversity of each cat, a top-N learning strategy is proposed during the tracking process of tracking mode cats to improve the convergence accuracy of the CSO. On ten standard test functions, the average values, standard deviations, and optimal values of the proposed algorithm with different N values are compared with the original CSO algorithm and the adaptive cat swarm algorithm based on dynamic search (ADSCSO). Experimental results show that the global search ability and the convergence speed of the proposed algorithm are significantly improved on all test functions. The proposed two strategies will improve the convergence accuracy and convergence speed of CSO greatly.

Cite

CITATION STYLE

APA

Songyang, L., Haipeng, Y., & Miao, W. (2022). Cat swarm optimization algorithm based on the information interaction of subgroup and the top-N learning strategy. Journal of Intelligent Systems, 31(1), 489–500. https://doi.org/10.1515/jisys-2022-0018

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free