计算机工程与应用 ›› 2015, Vol. 51 ›› Issue (9): 244-247.
• 工程与应用 • 上一篇 下一篇
崔建双,王憧憬
出版日期:
发布日期:
CUI Jianshuang, WANG Chongjing
Online:
Published:
摘要: 提出了一种限速粒子群算法用于求解多重背包问题。通过对迭代过程中不同位置的限速更新,使得搜索效率大大提高,获得最优值的概率也大幅提高。给出了算法流程图,分析了限速值对计算结果的影响。算例的计算结果证明了该算法的有效性。
关键词: 多重背包问题, 粒子群算法, 限速
Abstract: 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 significantly 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.
Key words: multi-knapsack problem, Particle Swarm Optimization(PSO), speed limit
崔建双,王憧憬. 求解多重背包问题的限速粒子群算法[J]. 计算机工程与应用, 2015, 51(9): 244-247.
CUI Jianshuang, WANG Chongjing. Solving multiple knapsack problem with speed limit particle swarm algorithm[J]. Computer Engineering and Applications, 2015, 51(9): 244-247.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2015/V51/I9/244