
Original cuckoo search 111
where x
t
j
and x
t
k
are two different solution vectors, randomly selected from
the population for i = 1, 2, ..., n. The switching condition with a probability p
a
is realized by a Heaviside function (or a step function) by comparing p
a
with
a random number drawn from a uniform distribution in [0, 1]. In addition, s
is a step size by random permutation of solution differences, and this is scaled
by a scaling factor α. Furthermore, the product of two vectors is an entry-wise
multiplication using ⊗.
The other equation is mainly for non-local random walks by Lévy flights
x
t+1
i
= x
t
i
+ αL(s, β), (9.2)
where the step sizes are drawn from