The simulation result indicates that the performance of BSPSO on knapsack problem, with a quicker convergence, is superior to the greed and genetic algorithms.

• 测试结果表明：采用该算法求解0/1背包问题所得的最优解明显优于贪婪算法和遗传算法，且有较快的收敛速度。