摘要
对于背包问题现有许多不同的求解方法。文中给出基于PSO的背包问题的一种新的求解方法。首先将背包问题对应到PSO算法中位置和速度的表示,建立了解决资源分配问题的随机粒子群算法,同时利用建立的算法与遗传算法比较,可见PSO得到了满意的计算结果。
Many various ways exist to resolve the Knapsack Problem, and this paper provides a new method called PSO to resolve it, First the relation between the Knapsack Problem and PSO is expressed including the place and speed of particles so that PSO for resource distribution is built. Finally, by the comparison and analysis, the Knapsack Problem gained better results with the algorithm mentioned above.
出处
《微机发展》
2005年第10期23-25,共3页
Microcomputer Development
关键词
背包问题
粒子群算法
约束优化
资源分配
knapsack problem
PSO
constrain optimal
resource distribution
