Meysam Orouskhani; Yasin Orouskhani; Mohammad Mansouri; Mohammad Teshnehlab

A Novel Cat Swarm Optimization Algorithm for Unconstrained Optimization Problems

Full Text (PDF, 516KB), PP.32-41

Views: 0 Downloads: 0

Author(s)

Meysam Orouskhani ^1,* Yasin Orouskhani ² Mohammad Mansouri ³ Mohammad Teshnehlab ⁴

1. Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran Iran

2. BSc Student, Computer School of Sharif University of Technology, Tehran, Iran

3. Intelligent System Laboratory (ISLAB), Electrical and Computer engineering department, K.N.Toosi University

4. Industrial Control Center of Excellence, Faculty of Electrical and Computer Engineering, K.N. Toosi University

* Corresponding author.

DOI: https://doi.org/10.5815/ijitcs.2013.11.04

Received: 7 Dec. 2012 / Revised: 20 Apr. 2013 / Accepted: 5 Jul. 2013 / Published: 8 Oct. 2013

Index Terms

Swarm Intelligence, Cat Swarm Optimization, Evolutionary Algorithms

Abstract

Cat Swarm Optimization (CSO) is one of the new swarm intelligence algorithms for finding the best global solution. Because of complexity, sometimes the pure CSO takes a long time to converge and cannot achieve the accurate solution. For solving this problem and improving the convergence accuracy level, we propose a new improved CSO namely ‘Adaptive Dynamic Cat Swarm Optimization’. First, we add a new adaptive inertia weight to velocity equation and then use an adaptive acceleration coefficient. Second, by using the information of two previous/next dimensions and applying a new factor, we reach to a new position update equation composing the average of position and velocity information. Experimental results for six test functions show that in comparison with the pure CSO, the proposed CSO can takes a less time to converge and can find the best solution in less iteration.

Cite This Paper

Meysam Orouskhani, Yasin Orouskhani, Mohammad Mansouri, Mohammad Teshnehlab, "A Novel Cat Swarm Optimization Algorithm for Unconstrained Optimization Problems", International Journal of Information Technology and Computer Science(IJITCS), vol.5, no.11, pp.32-41, 2013. DOI:10.5815/ijitcs.2013.11.04

Reference

[1]Dorigo, M. 1997, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Trans. on Evolutionary Computation. 26 (1) pp 53-66.

[2]Eberhart, R, Kennedy, J. 1995, A new optimizer using particle swarm theory, Sixth International Symposium on Micro Machine and Human Science,pp 39-43.

[3]Karaboga, D. 2005, An idea based on Honey Bee swarm for numerical optimisation, Technical Report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department.

[4]Chu, S.C, Tsai, P.W, and Pan, J.S. 2006, Cat Swarm Optimization, LNAI 4099, 3 (1), Berlin Heidelberg: Springer-Verlag, pp. 854– 858.

[5]Santosa, B, and Ningrum,M. 2009, Cat Swarm Optimization for Clustering, International Conference of Soft Computing and Pattern Recognition, pp 54-59.

[6]Chu, S.C, Roddick, J.F, and Pan, J.S. 2004, Ant colony system with communication strategies, Information Sciences 167,pp 63-76

[7]Shi, Y, and Eberhart, R. 1999, Empirical study of particle swarm optimization, Congress on Evolutionary Computation,pp 1945-1950.

[8]Molga,M, and Smutnicki,C. 2005, Test functions for optimization needs”, 3 kwietnia.

[9]Orouskhani,M, Mansouri, M and Teshnehlab,M. 2011, Average-Inertia weighted Cat swarm optimization, LNCS, Berlin Heidelberg: Springer-Verlag, pp 321– 328.

International Journal of Information Technology and Computer Science (IJITCS)