A Novel Harmony Search Algorithm Based on Teaching-Learning Strategies for 0-1 Knapsack Problems

Algorithm 6

The procedure of learner phase.

For each learner  𝑋^𝑗, 𝑗=1,2,…,𝑁𝑃

  Randomly select another learner 𝑋^𝑘𝑗≠𝑘

   If  𝑋^𝑗  is superior to 𝑋^𝑘

     𝑋^𝑗,new=𝑋^𝑗,old+rand(1,𝐷)⋅^∗𝑋^𝑗−𝑋^𝑘

   Else

     𝑋^𝑗,new=𝑋^𝑗,old+rand(1,𝐷)⋅^∗𝑋^𝑘−𝑋^𝑗

   Endif

Endfor

If 𝑋^𝑗,new is superior to  𝑋^𝑗,old

  𝑋^𝑗=𝑋^𝑗,new

Endif