A Novel Discrete Global-Best Harmony Search Algorithm for Solving 0-1 Knapsack Problems

Algorithm 3

The procedure of improvising a new harmony of DGHS.

(1) Record the best harmony in the HM, and its index is represented by 𝑏𝑒𝑠𝑡

(2) for   𝑗=1 to 𝐷  do

(3)  // memory consideration

(4)  if   rand(0,1)⩽HMCR(𝑡)  then

(5)   𝑥^′_𝑗=𝑥_best,𝑗

(6)  else

(7)   Generate a random integer number 𝑎∈[1..HMS] ∧𝑎≠𝑏𝑒𝑠𝑡

(8)   𝑥^′_𝑗=𝑥_𝑎,𝑗

    // pitch adjustment for the pitch chosen randomly

(9)   if   rand(0,1)⩽PAR  then

(10)    𝑥^′_𝑗=𝑥^′_𝑗−1  // discrete genetic mutation

(11)   end if

(12)  end if

(13) end for