Research Article
Adaptive Cuckoo Search Algorithm for Unconstrained Optimization
Algorithm 2
Adaptive cuckoo search algorithm.
begin | Generate initial population of host nest , | Define minimum step size value | Define maximum step size value | for all do | Evaluate the fitness function | end for | while (iter < MaxGeneration) or (stopping criterion) | Calculate the average fitness value of all the host nests | Find the minimum fitness value among all the host nests | for all host nests do | Current position | Calculate the step size for Lévy flight using (2) | Generate a cuckoo egg from host nest by using Lévy flight | if ( falls outside the bounds) then | Replace with | end if | Calculate the fitness function | if () then | Replace with | Replace with | end if | end for | Abandon a fraction of the worst nests | Build new nests randomly to replace nests lost | Evaluate the fitness of new nests | end while | end |
|