Improvement of Twoswarm Cooperative Particle Swarm Optimization Using Immune Algorithms and Swarm Clustering Particle Swarm Optimization (PSO) is useful as a method for solving optimization problems with continuous value variables because the convergence speed of solution search is fast. PSO is a evolutionary computation method in which individuals (particles) with position and velocity information are placed in the search space and acts for the purpose of finding an optimal solution with sharing information with other particles. This study constructs a particle swarm optimization method introducing the immune algorithms to improve the search capability of each particle and perform solution search more efficiently. To verify the usefulness of the proposed method, some numerical experiments are performed in this study.

Cat Swarm Optimization Algorithm  A Survey and Performance Evaluation This paper presents an indepth survey and performance evaluation of the Cat Swarm Optimization (CSO) Algorithm. CSO is a robust and powerful metaheuristic swarmbased optimization approach that has received very positive feedback since its emergence. It has been tackling many optimization problems and many variants of it have been introduced. However, the literature lacks a detailed survey or a performance evaluation in this regard. Therefore, this paper is an attempt to review all these works, including its developments and applications, and group them accordingly. In addition, CSO is tested on 23 classical benchmark functions and 10 modern benchmark functions (CEC 2019). The results are then compared against three novel and powerful optimization algorithms, namely Dragonfly algorithm (DA), Butterfly optimization algorithm (BOA) and Fitness Dependent Optimizer (FDO). These algorithms are then ranked according to Friedman test and the results show that CSO ranks first on the whole. Finally, statistical approaches are employed to further confirm the outperformance of CSO algorithm.