An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems

Algorithm 2

New position updating formula of ICS.

For  𝑖=1 to n

 𝐬𝐭𝐞𝐩_𝐢=𝐱_𝐢^{𝐛𝐞𝐬𝐭}−𝐱_𝐢^{𝐰𝐨𝐫𝐬𝐭}

 𝐱_𝐢^′=𝐱_𝐢^{𝐛𝐞𝐬𝐭}±𝐫∗𝐬𝐭𝐞𝐩_𝐢

 if  (𝑟₁≤𝑝_𝑚)

  𝐱_𝐢^′=𝐚_𝐢+𝐫𝐚𝐧𝐝()∗(𝐛_𝐢−𝐚_𝐢)

  end if

end for