【摘要】 本文提出基于二进制编码的异步粒子群算法,并用来求解0/1背包问题。0/1背包问题是给定一些物品的重量和价格,给定一个重量值,然后一个一个的装进背包里,在这个重量值的约束下求得最大值的一种组合优化问题。本文利用所提出的基于收敛因子模型的异步粒子群算法来求解0/1背包问题,试验证明,用这种方法解决0/1背包问题是非常有效的。更多还原

【Abstract】 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.更多还原