!!"#$%&  









 



 



 











 
 



















 









 


 






 

 





 





 







 



























 
 

 

 






 


 

 

 





!"#$








%
 
" 
!

&







' &

( 
)*
!

&


"

"
*)+,-
!










 

 
.
/
!
!
!
0 1
&
 
.
2,)3
%
 
" 
!

&







' &

( 
 CAT SWARM OPTIMIZATION:
THEORY, PRACTICES & APPLICATIONS

M.DHIVYA
M.MYNAVATHI
S.KANIMOZHI SUGUNA
 ABOUT THE AUTHORS

Dr.M.Dhivya received her B.E., M.E. and Ph.D. Degree in Electrical Engineering in
the year 2006, 2008 and 2013 respectively. She is working as Associate Professor in
the Department of Electronics and Communication Engineering at New Horizon
College of Engineering. She has received a grant of Rs.3,84,000 from Texas
Instruments for organizing Four Day Faculty Empowerment PrograPPHRQ³$QDORJ
3RZHU (PEHGGHG V\VWHPV DQG :LUHOHVV ,R7´ 6KH KDV JXLGHG 40 Post Graduate
Scholars in Disciplines like Applied Electronics, Electric Drives and Embedded
Control, Power Electronics and Drives and Control and Instrumentation. She is the
reviewer of Elsevier- Swarm and Evolutionary computation, IOS press ± Journal of
Intelligent and Fuzzy systems, Journal of Experimental & Theoretical Artificial
Intelligence, Springer ± Neural Computing and Applications, International Journal of
System Assurance Engineering and Management, Hindawi ± The Scientific World
Journal, Taylor & Francis ± Journal of Experimental & Theoretical Artificial
Intelligence, Scirp International Journal of Communications, Network and System
Sciences. She has published 6 Book/Book Chapters, 12 Papers in International
Journals, 10 papers in proceedings of International conference, and organized 30
National Level Workshops/Guest Lectures/Conferences/Faculty Development
Programmes. Her research Interests are wireless Sensor networks, Embedded
systems, Real time systems, Optimization Techniques and Machine Learning.
Academia Profile: https://annauniv.academia.edu/DhivyaManian

Ms.M.Mynavathi Completed her B.E. and M.E. in Electrical Engineering. She is

working as Assistant Professor in the Department of electrical and Electronics
Engineering at Coimbatore Institute of Technology, Coimbatore, Tamilnadu, India..
She has Cleared GATE 2010 with a percentile of 86. She has secured NATIONAL
LEVEL MATHEMATICAL EXAM in First class. She Won Best student artist award
in a drawing competition held at national level. Her research interests include
Optimization, System Theory, Control System, and Electronic Devices and Circuits.
ii
Dr. S. Kanimozhi Suguna received her undergraduate degree B.Sc in Maths &
Physics- dual degree from Avinashilingam Home Science College for Women,
Avinashilingam Deemed University, Coimbatore in the year 2005, MCA from
College of Engineering, Guindy, Anna University, Chennai by 2008. Then she
completed her M.Phil from Vinayaka Missions Deemed University by 2009. Under
the guidance of Dr.S.Uma Maheswari, Professor, Department of ECE, she has
completed her research in Mammogram Image Classification using Monkey Search
Optimization (MSO) Technique and Routing Through Bee-Ant Colony Optimized
Routing Protocol (BACOR) in the year 2015. She has seven years of teaching
experience as SERF (Senior Engineering Research Fellow) and Teaching Assistant at
Anna University, Regional Campus, Coimbatore. Currently, she is working as an
Assistant Professor in the Department of Computer Science and Engineering, School
of Computing, SASTRA University, Thanjavur, India from 2017. Her research
interests include Image Processing, Data Mining, Web Mining, Wireless Sensor
Networks. She is serving as an Editorial Member in various journals in IGI - Global
publications and also Editorial Advisory Board in various International Conferences.
Dr. S. Kanimozhi Suguna is the member of IEEE and CSI. She has four Book
Chapter publications under Springer and IGI - Global, 12 International Journal
publications that include both Scopus and non-Scopus indexing, and five conference
presentations. She has guided more than 50 post-graduate students at Anna
University, Regional Campus, Coimbatore. She has also worked under various
administrative departments in her prior working institution. She has organized a
variety of events like FDP, conference, workshop, seminars, and symposium at her
previous working institution.

iii
 TABLE OF CONTENTS
CHAPTER TITLE PAGE
NO NO
ABOUT THE AUTHORS ii
LIST OF FIGURES x
LIST OF TABLES x
1 INTRODUCTION 1
1.1 CLASSIFICATION OF OPTIMIZATION 1
1.2 NATURE INSPIRED OPTIMIZATION 2
TECHNIQUES
1.2.1 Evolutionary Computation 4
1.2.2 Immune Systems 5
1.2.3 Neural Networks 6
1.3 SOCIAL SYSTEMS 7
1.4 SCOPE OF CSO 8
1.5 SUMMARY 10

2 CAT SWARM OPTIMIZATION 11

2.1 WHAT IS CAT SWARM OPTIMIZATION? 12
2.2 BEHAVIOUR TRAITS OF CATS 12
2.3 TERMINOLOGIES AND OPERATORS OF CSO 14
2.3.1 Solution Set 14
2.3.2 Fitness Value and Fitness Function 14
2.3.3 Flag 14
2.3.4 Mixed Ratio 15
2.4 FORMULATION OF CSO ALGORITHM 15
2.4.1 Seeking Mode 15
2.4.2 Tracing Mode 17
2.4.3 Description of CSO Algorithm 19

iv
 2.5 TEST FUNCTIONS FOR CSO 21
2.6 SUMMARY 24

3 ADVANCED TECHNIQUES IN CAT SWARM 26

OPTIMIZATION
3.1 PARALLEL CSO 26
3.2 ADAPTIVE DYNAMIC CAT SWARM 29
OPTIMIZATION
3.2.1 Dynamic Velocity Update Equation 29
3.2.2 Dynamic Position Update Equation 31
3.3 DISCRETE BINARY CAT SWARM 33
OPTIMIZATION
3.3.1 Seeking Mode Algorithm 34
3.3.2 Tracing Mode Algorithm 35
3.4 ENHANCED PARALLEL CAT SWARM 36
OPTIMIZATION
3.5 MULTIOBJECTIVE CSO 36
3.5.1 Chaotic Cat Swarm Algorithm 36
3.5.2 Multi objective Cat Swarm Optimization 37
3.6 HYBRIDIZATION OF CSO 38
3.6.1 Homotopy Inspired CSO 38
3.6.2 Modified Cat Swarm Optimization and Gradient 38
Descent Algorithm
3.6.3 Hybrid PCSOABC 39
3.7 SUMMARY 39

4 APPLICATIONS OF CSO 41
4.1 CLUSTERING 42
4.1.1 Cat Swarm Optimization for Clustering 42

v
 4.1.2 Cat swarm optimization clustering (KSACSOC): A 42
cat swarm optimization clustering algorithm
4.1.3 An Ad-Hoc Approach For Data Clustering using 43
Meta-heuristic Algorithms
4.1.4 CSO-Based Feature Selection and Parameter 43
Optimization for Support Vector Machine
4.1.5 Modified Cat Swarm Optimization Algorithm for 43
Feature Selection of Support Vector Machines
4.1.6 Cat Swarm based Optimization of Gene Expression 44
Data Classification
4.2 POWER SYSTEMS 44
4.2.1 Enhancement of ATC with STATCOM using Cat 44
Swarm Optimization
4.2.2 CSO Algorithm for Economic Dispatch Decision of 45
Hybrid Generation System
4.2.3 a. Optimal placement of svc and statcom for 45
Voltage stability enhancement under Contingency using
Cat Swarm Optimization
4.2.3 b. Cat Swarm Optimization for optimal placement 45
RIPXOWLSOH83)&¶V in voltage stability enhancement
under contingency
4.2.4 Voltage Stability Enhancement Using Cat Swarm 46
Optimization Algorithm
4.3 STOCK MARKET & SUPPLY CHAIN 46
MANAGEMENT
4.3.1 Cat Swarm Optimization for Single Stage Supply 46
Chain Distribution System with Fixed Charges
4.3.2 Improved Cat Swarm Optimization Approach 46
Applied to Reliability- Redundancy Problem

vi
 4.3.3 Cat Swarm Optimization Based Neural Network 46
and Particle swarm optimization Based Neural Network
in Stock Rates Prediction
4.3.4 Forecasting of currency exchange rates using an 47
adaptive ARMA model with differential evolution based
training
4.3.5 A Comparative Study of CSO and PSO Trained 47
Artificial Neural Network for Stock Market Prediction
4.4 ELECTRONICS AND COMMNICATION 47
4.4.1 Linear antenna array synthesis using Cat Swarm 47
Optimization
4.4.2 a. Comparative performance analysis of 48
evolutionary algorithm based parameter optimization in
cognitive radio engine: A survey
4.4.2 b. Cooperative spectrum sensing in cognitive radio 48
network using multiobjective evolutionary algorithms
and fuzzy decision making
4.4.2 c. Multiobjective Cooperative Spectrum Sensing in 48
Cognitive Radio using Cat Swarm Optimization
4.4.3 Pareto optimization of cognitive radio parameters 48
using multiobjective evolutionary algorithms and fuzzy
decision making
4.4.4 Enhanced parallel cat swarm optimization based on 49
the Taguchi method
4.4.5 On Deployment of Wireless Sensors on 3-D 49
Terrains to Maximize Sensing Coverage by Utilizing Cat
Swarm Optimization with Wavelet Transform
4.4.6 An Energy-Aware Routing Protocol Using Cat 50
Swarm Optimization for

vii
Wireless Sensor Networks
4.5 INTERACTIVE LEARNING ENVIRONMENT 50
4.5.1 The success of ePortfolio-based programming 50
learning style diagnosis: Exploring the role of a heuristic
fuzzy knowledge fusion
4.5.2 The Classroom Response System Based on 50
Affective Computing
4.6 IMAGE PROCESSING & FILTERS 51
4.6.1 Optimizing least-significant-bit substitution using 51
cat swarm optimization strategy
4.6.2 Vector Quantization Codebook Design Method for 51
Speech Recognition Based on Immune Cat Swarm
Optimization Algorithm
4.6.3 Enhancing the Performance of Watermarking 51
Based on Cat Swarm Optimization Method
4.6.4 A Novel Block Matching Algorithm Based on Cat 52
Swarm Optimization for Efficient Motion Estimation
4.6.5 Cat Swarm Optimization For Optimizing 52
Hybridized Smoothening Filter In Image Edge
Enhancement
4.6.6 Single Bitmap Block Truncation Coding of Color 52
Images Using Cat Swarm Optimization
4.6.7 Analyzing the Performance of Watermarking 52
Based on Swarm Optimization Methods
4.6.8 Comparison of Cat Swarm Optimization with 52
Particle Swarm Optimization for IIR System
Identification
4.7 CONCLUSIONS AND FUTURE APPLICATIONS 53
OF CSO IN REAL TIME APPLICATIONS:

viii
 4.7.1. Future Insights: 54
REFERENCES 55

ix
 LIST OF FIGURES

FIGURE NAME PAGE

NO NO
1.1 Nature Inspired Algorithms 2
2.1 Behavior Traits of Cats 13
2.2 Flowchart for Seeking Mode of Cats 18
2.3 Flowchart for Tracing Mode 19
2.4 Description of CSO Algorithm 20
2.5 Rosenbrock function 24
3.1 Flowchart of Parallel Cat Swarm Optimization 27
3.2 Experimental result of Rastrigrin function. 28
3.3 Structure of Adaptive Dynamic CSO 30
4.1 Applications of Cat Swarm Optimization 41

LIST OF TABLES

TABLE TITLE PAGE

NO NO
2.1 Seeking Behavior of Cats 16
2.2 Parameter setting of CSO 21
2.3 Limitation Range of Benchmark Functions 23
3.1 Parameter Setting for CSO and Adaptive Dynamic CSO 32
3.2 Experimental results of six standard test functions. 32

x
 CHAPTER 1
INTRODUCTION
Optimization is the study of planning, designing, and solving complex
problems in day-to-day life in recent years. The optimization problems are of
high significance in knowledge-based domain like scientific sector and economy
based domain like Industrial Sector. Right from vehicle logistics management to
constraint job scheduling and from data repository integration, Vision tracking
to NP-Hard Problem solving, optimization management is subjected to various
constraints. The main objective in optimization is to optimize the physical
parameter depending on the problem considered. In the past decade, the
µ'DUZLQLDQIDEOHV¶WKDWLQVSLUHGWKH VFLHQWLVWVPDWKHPDWLFLDQVUHVHDUFKHUVDQG
biologists to employ various Biological (or) Nature-Inspired Algorithms for
solving almost endless array of real-time application. Hence the analytical
performance of the mathematical model is simulated using diverse nature-
LQVSLUHG VHDUFK WHFKQLTXHV WR REWDLQ JRRG ³WUDGH-RII´ VROXWLRQV ZLWK ILUP
conciliation.

1.1 CLASSIFICATION OF OPTIMIZATION

The categorization of optimization algorithms is broadly classified as
Deterministic and Probabilistic algorithms. The deterministic algorithms are
classical optimization technique which has limited scope in the practical
scenario as they can solve only single variable functions and multivariable with
no constraints. The stochastic (or) probabilistic algorithms are an advanced
optimization technique which inherits the essential numerical techniques of
classical optimization and also has many optimal input parameters like
randomness, robustness, constraint functions, dimension factor, equalities,
scalability, etc., to ease the computation.
This basic set of classification is again subclassified into various streams
depending on two mechanisms, namely Guided/Non-Guided and Direct/Indirect.
1

 The examples of classical direct optimization techniques are Greedy search,
Fibonacci Series, Golden Section Search, Nelder, and Mead, etc. Hill Climbing,
Grammatical Systems, Evolutionary Systems, Social Systems, etc. are examples
for guided probabilistic algorithms. Backtracking and Las Vegas falls under the
classification of non-guided search techniques (1). Most of the biologically
inspired optimization algorithms fall under the category of Monte Carlo (MC)
algorithms. It is an essential classification of probabilistic algorithms. MC
encompasses all algorithms that are based on a set of multiple solution
FDQGLGDWHVFDOOHGµ3RSXODWLRQ¶ZKLFKLVLWHUDWLYHO\UHILQHG
As optimization does not entail highly precise functional solutions,
nowadays Multi-modal and Multi-objective optimization has garnered reception
in the research arena, on account of a multitude of practical problems in the
different fields of Science and Engineering. No single algorithm is superior to
other and hence many meta-heuristics, and novel optimization algorithms
emerge as a major player for solving multi-objective global optimization, as they
often mimic the successful characteristics in nature, especially Social Systems
(3). Considering the above underlying principles, the brief classification of
Nature-inspired meta-heuristic algorithms can be contrived.

1.2 NATURE INSPIRED OPTIMIZATION TECHNIQUES

Biologically Inspired Algorithms is a class of optimization technique which
is concerned with the design of intelligent multi-agent systems encompassing
robust adaptation combined with machine learning astuteness. These algorithms
are derived by captivating the stirring inspiration of the collective behavior and
decentralized management structure of biological species. By carefully studying
the underlying individual behaviors and combining behavioral observations, the
researchers and scientists have solved real life problems with mathematical or
simulation modeling (4). Unique optimization techniques are proposed in past
years due to strenuous research efforts, for the exploration and exploitation of
solution sets with diversification and intensification. In most cases, the natural
2

 computation outperforms the traditional/standard optimization algorithms with
the attributes of memory update and population-based search solutions.

Figure 1.1: Nature Inspired Algorithms

The taxonomy of natural computing is classified into seven major categories
as Stochastic Algorithms, Physical algorithms, Probabilistic Algorithms,
Evolutionary Computation, Neural Networks, Social Systems, and Immune
Systems (5). It is depicted in Figure 1. Although the stochastic, physical, and
probabilistic algorithms are classified under nature-inspired algorithms by Jason
Brownlee, these algorithms do not seem refined and bang-up with other
categories of Bio-Inspired Computation. Physical algorithms are inspired by
physical systems to solve hardcore problems in the field of Engineering and
3