An improved particle swarm optimization algorithm for solving 0–1 Knapsack problem

According to the correlation and dependence among items in 0–1 Knapsack problem, this paper proposes an mproved PSO based on probability model to solve the problem. The algorithm proposes a new updating equation and operates on the probability vector according to the statistic probability to perform the evolution. The example shows that this algorithm has a faster convergence rate and a higher rate of success to solve the 0–1 knapsack problem.