An improved shuffled frog-leaping algorithm for knapsack problem

Abstract

Shuffled frog-leaping algorithm (SFLA) has long been considered as new evolutionary algorithm of group evolution, and has a high computing performance and excellent ability for global search. Knapsack problem is a typical NP-complete problem. For the discrete search space, this paper presents the improved SFLA (ISFLA), and solves the knapsack problem by using the algorithm. Experimental results show the feasibility and effectiveness of this method. © 2012 Springer-Verlag GmbH.