On hybrid algorithm for knapsack problem based on shuffled leapfrog algorithm

Liang Chen · Journal of Henan University of Urban Construction · 2011

The shuffled frog leaping algorithm is a new post based on swarm intelligence heuristic computing technology,a highly efficient computing performance and good global search capability.This paper describes the 0/1 knapsack problem,a mathematical model,and explains the basic theory of shuffled frog leaping algorithm.Through adding mutation method in the process of global information exchanges,an improved hybrid leapfrog algorithm is proposed and using the algorithm to solve the 0/1 knapsack problem,and instances show that the algorithm has better feasibility and effectiveness.

Read the paper · More papers on PaperTik