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

Algorithm 1

The improvisation procedure of new harmony by classical HS.

For  i = 1 to D

  If  rand() < HMCR

     𝑥^new_𝑖=𝑥^𝑗_𝑖,𝑗∈𝑈{1,2,…,HMS}

    If  rand() < PAR

        𝑥^new_𝑖=𝑥^new_𝑖±rand()×BW(𝑖)

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

    Endif

  Else

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

   Endif

EndFor