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 improved 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.

关键词： PSO Knapsack problem Probability statistic

作者: GUO-LI ZHANG YI WEI

作者单位: Department of Mathematics and Physics, North China Electric Power University, Baoding 071003, China Department of Computer Science and Technology, North China Electric Power University, Baoding 071003

会议类型: 国际会议

会议名称: 2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

会议地点: 昆明

会议语种:英文

页码: 915-918

在线出版日期: 2008-07-12（万方平台首次上网日期，不代表论文的发表时间）