改进的粒子群算法求解背包问题

Modified particle swarm optimization algorithm for knapsack problem

摘要: 本文提出了改进的粒子群算法求解背包问题,阐明了该算法求解背包问题的具体实现过程.通过与其他文献中实例的计算结果比较,表明该算法切实可行,有较高的搜索效率.

Abstract: In this paper,a modified particle swarm optimization algorithm is presented to solve knapsack problem,and the detailed realization of the algorithm is illustrated.By comparing the calculating results with some examples in other references,it can be found that this modified particle swarm optimization algorithm is available and efficient in solving knapsack problem.