PCB Drill Path Optimization by Combinatorial Cuckoo Search Algorithm

Pseudocode 1

Pseudocode of the cuckoo search algorithm.

begin

   Objective function 𝑓(𝑥)

   Generate initial population of 𝑛 host nest

   Evaluate fitness and rank eggs

   while (𝑡 > MaxGeneration) or Stop criterion

      𝑡=𝑡+1

     Get a cuckoo randomly/generate new solution by Lévy flights

     Evaluate quality/fitness, 𝐹_𝑖

     Choose a random nest 𝑗

      if  (𝐹_𝑖>𝐹_𝑗)

      Replace 𝑗 by the new solution

      end if

     Worst nest is abandoned with probability 𝑃_𝑎 and new nest is built

       Evaluate fitness and Rank the solutions and find current best

   end while

      Post process results and visualization

end