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

Algorithm 2

The improvisation procedure of new harmony by NGHS.

For  i = 1 to D

  𝑥^𝑟_𝑖=2×𝑥^best_𝑖−𝑥^worst_𝑖

  𝑥^𝑟_𝑖=minmax𝑥^𝑟_𝑖,𝑥^𝐿_𝑖,𝑥^𝑈_𝑖

  𝑥^new_𝑖=𝑥^worst_𝑖+rand()×𝑥^𝑟_𝑖−𝑥^worst_𝑖.

  If  rand() ⩽𝑝_𝑚 %random mutation

          𝑥^new_𝑖=𝑥^𝐿_𝑖+𝑥^𝑈_𝑖−𝑥^𝐿_𝑖×rand()

  Endif

EndFor