摘要将带有死亡罚函数的二进制粒子群优化算法应用于0/1背包问题。

• In this paper, we try to apply Binary System Particle Swarm Optimization (BSPSO) with death Penalty function to solve 0/1 knapsack problem.