PCB Drill Path Optimization by Combinatorial Cuckoo Search Algorithm

Pseudocode 3

Pseudocode for fitness evaluation.

Input: 𝑥

[~, sol] = sort(𝑥);

sol = [sol, sol(1)];

fitness = 0;

longest = 0;

For   𝑖=1: number of holes

  fitness = fitness + distance between holes 𝑖 and 𝑖+1;

   if longest < distance between holes 𝑖 and 𝑖+1

   longest = distance between holes 𝑖 and 𝑖+1;

   position = 𝑖;

   end if

end for

if position ∼= number of holes

  sequence = [sol(position + 𝑖: end − 1), sol(1: position)];

else

  sequence = sol (1: end − 1);

end if