摘要
设计了一种用于求解0-1背包问题的粒子群优化算法,阐述了算法求解0-1背包问题的具体操作过程。通过对其它文献中仿真实例的计算和结果对比,表明了该算法对求解0-1背包问题的可行性和有效性。
A kind of special particle swarm optimization for 0 - 1 knapsack problem is designed in this paper, and the detailed realization of the algorithm is illustrated. Example in other references is recomputed and both simulation results are compared. It can be found that the possibility and the efficiency of the algorithm in solving 0- 1 knapsack problem.
出处
《廊坊师范学院学报（自然科学版）》
2010年第5期18-19,共2页
Journal of Langfang Normal University(Natural Science Edition)
关键词
粒子群优化算法
背包问题
群体智能
particle swarm optimization
knapsack problem
swarm intelligence
