Algorithm 1: Cuckoo Search Optimization (CSO).

Start Objective function f(x) Random generation of initial population of n host nests xi (i = 1, 2, …, n) While (t < Max Generation);    Get a cuckoo randomly by Levy flights;    Evaluate its fitness F(i);    Choose a nest among n (Let the nest, j) randomly; $\mathbf{if} ( {\mathbf{F}}^{\mathbf{i}}>{\mathbf{F}}^{\mathbf{j}}$ The new solution is to replace j; end A probability (pa) of worse nests are unrestrained and a new nest is constructed; The best solutions are stored, i.e., the nests having the quality solution Solutions to be ranked and find the current best; end while end Result