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 (2022)
  Copy   BIBTEX

Abstract

Because of the lack of interaction between seeking mode cats and tracking mode cats in cat swarm optimization, 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. 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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2022-04-20

Downloads
41 (#400,220)

6 months
35 (#103,332)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Miao Wang
Murray State University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references