An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems

Algorithm 2

The main procedure of CSISFLA algorithm.

Begin

Step  1. Sorting. According to value-to-weight ratio in descending

order, a queue of length is formed.

Step  2. Initialization. Set the generation counter ; Set probability of mutation .

Generate cuckoo nests randomly . Divide the whole

population into memeplexes, and each memeplex contains (i.e.P/M) cuckoos; Calculate

the fitness for each individual, , , determine the global optimal individual

and the best individual of each memeplex , .

Step  3. While the stopping criterionis not satisfied do

    For    to

       mod

       select uniform randomly

      For to

           //Levy flight

          If     then       //   The first frog leaping

             Temp  =

          Else

             Temp  =

          End if

      End for

      If    then    //   Generate new individual

           =  Temp

      Else If       then      // Random selection

         End if

      End if   where

Repair the illegal individuals and optimize the legal individuals by performing GTM method

  End for

Keep best solutions.

Rank the solutions in descending order and find the current best .

Step  4.   Shuffle all the memeplexes

Step  5.    End while

End.