A Shuffled Frog Leaping Algorithm for Solving Knapsack Problem
Zhang Cui-jun · Science Technology and Engineering · 2009
Shuffled Frog Leaping Algorithm (SFLA) is a new meta-heuristic population evolutionary algorithm. It has fast calculation speed and excellent global search capability. Knapsack problem is a typical NP-complete problem. The 0—1 Knapsack problem mathematical model is established first,then the basic principle of SFLA is introduced. Aim at searching in discrete search space,an improved SFLA algorithm is given. And then,it is used to solve Knapsack problem. The results got on some typical instances show that the proposed method is feasible and effective.