求解多重背包问题的限速粒子群算法

摘要

提出了一种限速粒子群算法用于求解多重背包问题。通过对迭代过程中不同位置的限速更新，使得搜索效率大大提高，获得最优值的概率也大幅提高。给出了算法流程图，分析了限速值对计算结果的影响。算例的计算结果证明了该算法的有效性。%A speed limit particle swarm algorithm for solving the multiple knapsack problem is presented. By limiting the speed in different positions, the search efficiency of the algorithm and the probability of obtaining optimum are signifi-cantly increased. The algorithm flowchart is demonstrated. The influence with different speed limit values is tested. The instance test results prove the effectiveness of the proposed algorithm.