A Novel Compact Cat Swarm Optimization Based on Differential Method

Abstract

ABSTRACTA compact cat swarm optimization scheme (cCSO) is proposed in this paper, which is designed to solve application domains plagued with limited memory and less-computation power, as a member of cat swarm optimization algorithms (CSO), it composes of two sub-modes, i.e., tracing and seeking modes, so it keeps the same search logic of CSO. On the other hand, cCSO inherits the main feature of compact algorithms, a normal probabilistic model is used to represent the population of solutions instead of processing an actual population, which ensures the cCSO to have the modest memory requirement. The updating vector for the probabilistic model provides a clear moving direction for cats in next step. A cat without historical position and velocity is applied in the algorithm. When the cat is in seeking mode, it employs a differential operator to update the cat’s position, which makes it possible for the cat to have multiple searching directions. Experimental results show that cCSO has pretty performance compared with respect to some population-based testing benchmarks. And it also shows superior performance in convergence rate to some compact optimization algorithms. The case study of gray image segmentation proves that it suits for solving the optimization problem by limited hardware.