ABSTRACT
In the chapter we focus on a cockroach swarm optimization (CSO) algorithm, which has the advantage of being easily implementable. We begin by giving a brief overview and the pseudo-code form of the CSO algorithm. Then, we present some modifications of CSO including inertia weight, stochastic constriction factor, hunger component, and various neighborhoods. Moreover, the purpose of this section is to demonstrate how the CSO algorithm can be adapted for solving combinatorial optimization problems. Therefore, we present an application of the CSO algorithm for the traveling salesman problem and its results. The final section derives useful conclusions.
