A New Improved Quantum Evolution Algorithm with Local Search Procedure for Capacitated Vehicle Routing Problem

Algorithm 1

Pseudo codes of adaptive mutation operation.

(1) Settings: 𝑃_𝑚=1−𝑔𝑒𝑛/𝑚𝑎𝑥𝑔𝑒𝑛, 𝑁=ceil(𝑃_𝑚×popsize);

(2)  iF  𝑁 > popsize then

(3)   𝑁 = popsize;

(4)  end if

(5) Randomly generate the positions Npos of 𝑁 Q-chroms, Npos ∈ [1, popsize];

(6) Randomly generate 𝐾 different intergers in each group, 𝐾∈Mutpo;

(7)  if  𝑁≠0  then

(8)   for  𝑖=1 to 𝑁  do

(9)     for  𝑘=1 to 𝐾  do

(10)     Use the quantum Not-gate mutating the specific 𝑄-bit;

(11)     end for

(12)   end for

(13) end if