Algorithm 7 CS

Input: the parameters M, N,$\delta$, $\alpha$ and $p_a$ Begin S1: initialize M host nests $x_i\left(t\right)$ randomly,$0<i\le M,$ iterative times t = 1; S2: compute$f\left(i\right),0<i\le M$, update$p_g\left(t\right)$; if it satisfies (t > N or precision$\le \delta$), then go to step S4; otherwise, go to step S3; S3: choose a cuckoo randomly to generate a new solution by Equation (18); choose a nest among M individuals randomly; if the new solution is better than the chosen nest, replace it; a fraction ($p_a$) of the worst nests are replaced by the new nests by Equation (20), iterative times t = t + 1; go to step S2; S4: output the optimized results. End