Swarm Intelligence Algorithms

88 Cockroach Swarm Optimization

satisfied. The simplest criterion is a maximum number of iterations that the

CSO algorithm executes, or a limited number of fitness function evaluations.

In the chase-swarming procedure (steps 9 to 19), in the new cycle, the

strongest cockroaches carry the local best solutions P

i

, form small swarms,

and move forward to the global optimum P

g

according to the formula (step

13): X

i

= X

i

+ step ·rand · (P

g

− X

i

). Within this procedure, each individual

X

i

moves to its local optimum P

i

in the range of its visibility (step 16) using

the formula: X

i

= X

i

+ step · rand · (P

i

− X

i

).

There can occur a situation when a cockroach moving in