Swarm Intelligence Algorithms

Original CSO algorithm 59

probability for all of the candidates’ points to 1, otherwise use the equation

described in the next step; (4) pick the point to move to randomly from the set

of candidate points and replace the position of the cat X

i

using the following

equation:

P

i

=

F S

i

− F S

b

F S

max

− F S

min

(5.2)

where 0 < i < j, P

i

is the probability of the candidate cat X

i

, F S

i

is the

fitness value of the cat X

i

, F S

max

is the maximum value of the fitness func-

tion, F S

min

is the minimum value of the fitness function, F S

max

= FS

b

for

maximization problems and F S

b

= F S

min

for minimization problems.

5.2.2.2 Tracing mode (movement)

The tracing mode simulates the chasing ...