PCB Drill Path Optimization by Combinatorial Cuckoo Search Algorithm

Pseudocode 2

Pseudocode of the combinatorial cuckoo search algorithm.

begin

 Evaluation Matrix

 Objective function 𝑓(𝑥);

 Generate initial population of 𝑛 host nest;

 Evaluate fitness and rank eggs;

 while (𝑡 > MaxGeneration) or Stop criterion

    𝑡=𝑡+1

   Best cuckoo performs Lévy flights and lay eggs (say 𝑥_new) in all nests;

   Evaluate quality/fitness, 𝐹_𝑥new;

    if   (𝐹_𝑥new<𝐹_𝑥)

     Replace current solution with new solution

    end if

      New eggs (say 𝑥_new) are laid by host birds via Lévy flights

       with a mutation fraction of 𝑃_𝑎;

      Evaluate quality/fitness, 𝐹_𝑥new;

      if   (𝐹_𝑥new<𝐹_𝑥)

        Replace current solution with new solution

      end if

       Rank the solutions and find current best

    end while

Post process results and visualization

end