用基于二进制编码的异步粒子群算法解0/1背包问题  

Asynchronous Pattern of Particle Swarm Optimization Algorithm Based on Converging Factor Model for Solving 0-1 Knapsack Problem

作　　者：陈海雷[1] 玄光哲[1] 于海[1] 钟时[1] 

机构地区：[1]吉林大学计算机科学与技术学院,长春130012

出　　处：《长春理工大学学报（自然科学版）》2006年第2期69-71,共3页Journal of Changchun University of Science and Technology(Natural Science Edition)

摘　　要：本文提出基于二进制编码的异步粒子群算法,并用来求解0/1背包问题。0/1背包问题是给定一些物品的重量和价格,给定一个重量值,然后一个一个的装进背包里,在这个重量值的约束下求得最大值的一种组合优化问题。本文利用所提出的基于收敛因子模型的异步粒子群算法来求解0/1背包问题,试验证明,用这种方法解决0/1背包问题是非常有效的。An asynchronous pattern of Particle Swarm Optimization algorithm based on Converging Factor Model is presented in this article. The proposed algorithm is programmed with java multiple threads and is examined in solving 0-1 knapsack problem. 0-1 knapsack problem is a max-value searching problem during which the weights and values are given and the total weights must be not over the weight that is given before. The experiments show that it is effective for solving 0-1 knapsack problem.

关 键 词：粒子群算法 收敛因子模型 异步模式 0/1背包问题 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]