Algorithm 1 Cuckoo search algorithm

Input: (n, p, kmax)

Output: x 0

1: Randomly initialize n candidates ${\overline{x}}_i=(i=1,2,...,n-1)$

2: Calculate the error $f_i$ of each candidate $x_i$

3: Sort the population in ascending order of error $f_i$

4: for ($k=0:k<k_{max}$) do

5:    for ($i=0:i<p*n$) do

6:      Randomly pick a candidate $x_i$ with error $f_i$

7:      Generate $x_j$ by mutating $x_i$ using Equation (6)

8:      Calculate error $e_j$ of $x_j$

9:      if ($e_j<f_i$) then

10:         Replace $x_i$ with $x_j$

11:      end if

12:    end for

13:    Sort the population in ascending order of error $f_i$

14:    Randomly initialize $(p*n)$ worst candidates

15: end for