NRS-CSO: neighbourhood rough set-based cat swarm optimisation algorithms Online publication date: Tue, 13-Apr-2021
by Zi-Hao Leng; Jian-Cong Fan
International Journal of Computing Science and Mathematics (IJCSM), Vol. 13, No. 2, 2021
Abstract: Cat swarm optimisation (CSO) is a typical evolutionary method inspired by the cats in the nature for solving optimisation problem. After CSO is first proposed, it has been improved and applied in different fields, the series of CSO algorithms has been verified that they have better performance compared to many other swarm optimisation algorithms. In this research, we proposed a novel improved CSO named neighbourhood rough set-based cat swarm optimisation (NRS-CSO) and use neighbourhood rough set theory to improve the CSO algorithm. The NRS-CSO presented in this paper is implemented on a number of benchmark optimisation problems. The optimisation results are compared with four different optimisation algorithm including PSO and different variants of CSO. Experimental results show that in compare with the other algorithms, the proposed algorithm improves the performance of its final solution, it can take less time to converge and the whole iteration is less.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook