Algorithm 2 Cuckoo Search main steps

$\mathbf{Define}$ objective function $f\left(x\right)$ $\mathbf{Define}$ parameters L, $N_c$, M, $P_a$ $\mathbf{Generate}$ initial positions $x_i$ of the host nests t: = 1 while ($t\le M$) and (solution not yet found) do    $\mathbf{Choose}$ cuckoo j randomically    $\mathbf{Move}$ it using a Lévy step    $\mathbf{Evaluate}$ the quality of the new nest using $f\left(x\right)$    $\mathbf{Sort}$ existing nests based on the quality    $\mathbf{Abandon}$ $P_a$ of the worst nests    $\mathbf{Generate}$ new ones around the best nest    $\mathbf{Keep}$ the remaining 1 − $P_a$ nests with the best quality    $\mathbf{Sort}$ nests and pick the best one    t: = t + 1 end while $\mathbf{Return}$ the best nest