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

Algorithm 3

The improvisation procedure of new harmony by ITHS.

For i  = 1  to D  do

   If  rand() < HMCR

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

    If  rand() < PAR

       If  fit𝑥^𝑗≤fit   //Group  A

         If  rand() < 0.5

          𝑦_𝑖=𝑥^best_𝑖−rand()×𝑥^best_𝑖−𝑥^new_𝑖

         Else

            𝑦_𝑖=𝑥^best_𝑖−rand()×𝑥^worst_𝑖+𝑥^new_𝑖

         Endif

       Else    //Group  B

          𝑥^best_𝑚=𝑥^best_𝑚×𝑥^𝑈_𝑖/𝑥^𝑈_𝑚,𝑚∈𝑈{1,2,…,HMS}

          𝑦_𝑖=𝑥^new_𝑖+rand()×𝑥^best_𝑚−𝑥^new_𝑖

       Endif

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

     Endif

  Else

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

   Endif

EndFor