A Novel Complex Valued Cuckoo Search Algorithm

Algorithm 1

Pseudo code of cuckoo search via Lévy flight algorithm.

Cuckoo search via Lévy flight algorithm:

Begin

   Objective function 𝑓(𝑥),𝑥=(𝑥₁,𝑥₂,…,𝑥_𝑑)^𝑇

   Generate initial population of 𝑛 host nests 𝑥_𝑖(𝑖=1,2,…,𝑛)

 While (𝑡< Max Generation) or (stop criterion)

   Get a cuckoo randomly by Lévy flight

   Evaluate its quality/fitness 𝐹_𝑖

    Choose a nest among 𝑛 (say, 𝑗) randomly

  If (𝐹_𝑖>𝐹_𝑗),

    replace 𝑗 by the new solution;

  End

   A fraction (𝑝_𝑎) of worse nests are abandoned and new ones are built;

   Keep the best solutions (or nests with quality solutions);

   Rank the solutions and find the current best

 End while

   Post process results and visualization

End