摘要
给出了基于混沌粒子群优化算法(CPSO)背包问题的一种新的求解方法。首先将背包问题对应到粒子群算法中的位置与速度问题的表示,然后为了抑制早熟停滞现象,将混沌理论引进优化,使得背包问题更接近最优解。
This paper provides a new resolving method based on CPSO. Firstly, the Knapsack Problem corresponding to the expression of the place and speed of particles in PSO. Then, optimize it with the chaos theory in order to restrain premature stagnation. So it could make the result of the Knapsack Problem close to optimize .
出处
《宁波职业技术学院学报》
2009年第2期51-53,共3页
Journal of Ningbo Polytechnic