《SCI论文模板.docVIP

Running title: Li et al. On…. An improved shuffled frog-leaping algorithm for knapsack problem Authors’ name Affiliation Correspondence autuor(通讯作者：): tel/fax XXX; e-mail: XXX 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, and solves the knapsack problem by using the algorithm. Experimental results show the feasibility and effectiveness of this method. Keywords: shuffled frog-leaping algorithm; knapsack problem; optimization problem 0 Introduction Knapsack problem(KP) is a very typical NP-hard problem in computer science, which was first proposed and studied by Dantzing ??in the 1950s. There are many algorithms for solving the knapsack problem. Classical algorithms for KP are the branch and bound method (BABM), dynamic programming method （分支界定法和动态规划法）, etc. However, most of such algorithms are over-reliance on the features of problem itself, the computational volume of the algorithm increases by exponentially, and the algorithm needs more searching time with the expansion of the problem. Intelligent optimization problem for solving NP are the ant colony algorithm, greedy algorithm, etc. Such algorithms do not depend on the characteristics of the problem itself, and have the strong global search ability. Related studies have shown that it can effectively improve the ability to search for the optimal solution by combining the intelligent optimization algorithm with the local heuristic searching algorithm. Shuffled frog-leaping algorithm is a new intelligent optimization algorithm, it combines the advantages of meme algorithm based on genetic evolution and particle swarm algorithm based on group behavior. It has the following characteristics: simple in concept, few parameters, the ca