Research Article

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

Table 2

Knapsack problem instances.

ProblemCorrelationDimensionTarget weightTotal weightTotal values

KP1Uncorrelated150647186288111
KP2Uncorrelated20083281110410865
KP3Uncorrelated300123831651116630
KP4Uncorrelated500203632715028705
KP5Uncorrelated800333674448944005
KP6Uncorrelated1000419485593054764
KP7Uncorrelated1200494856598066816
KP8Weakly correlated150640385388504
KP9Weakly correlated20083581114411051
KP10Weakly correlated300125541673916778
KP11Weakly correlated500207582767727821
KP12Weakly correlated800333674448944491
KP13Weakly correlated1000418495579955683
KP14Weakly correlated1200498086641156811
KP15Strongly correlated300122471632919329
KP16Strongly correlated500213052840733406
KP17Strongly correlated800333674448952489
KP18Strongly correlated1000408835451164510
KP19Strongly correlated1200504306724079240
KP20Multiple strongly correlated300129081721123651
KP21Multiple strongly correlated500202592701237903
KP22Multiple strongly correlated800327674368961140
KP23Multiple strongly correlated1000424425658977940
KP24Multiple strongly correlated1200502226696392653
KP25Profit ceiling300126661688817181
KP26Profit ceiling500198112641526913
KP27Profit ceiling800320114268143497
KP28Profit ceiling1000422535633757381
KP29Profit ceiling1200502086694468157
KP30Circle300125541673926448
KP31Circle500208122774943880
KP32Circle800325814344169527
KP33Circle1000421075614388220
KP34Circle12004922065627104287