| 基于改进的粒子群算法求解0/1背包问题 |
| |
| 引用本文： | 徐刚,于泳波. 基于改进的粒子群算法求解0/1背包问题[J]. 齐齐哈尔大学学报(自然科学版), 2007, 23(1): 71-74 |
| |
| 作者姓名： | 徐刚 于泳波 |
| |
| 作者单位： | 大庆石油学院应用技术学院,河北,秦皇岛,066004;燕山大学理学院,河北,秦皇岛,066004 |
| |
| 摘 要： | 本文尝试把粒子群优化算法应用于0/1背包问题中,对算法模型进行适当的修改,并采用以目标函数加约束惩罚函数作为适应度函数的方法,仿真实验表明:粒子群算法在求解背包问题上结果良好。
|
| 关 键 词： | 改进的粒子群算法 背包问题 死亡罚函数法 |
| 文章编号： | 1007-984X(2007)01-0071-04 |
| 修稿时间： | 2006-10-27 |
Solution to the 0/1 knapsack problem based on Particle Swarm Optiziation |
| |
| XU Gang,YU Yong-bo. Solution to the 0/1 knapsack problem based on Particle Swarm Optiziation[J]. Journal of Qiqihar University(Natural Science Edition), 2007, 23(1): 71-74 |
| |
| Authors: | XU Gang YU Yong-bo |
| |
| Affiliation: | College of Application Tehnology, Daqing Petroleum Institute, Hebei Qinhuangdao 066004, China; 2. College of Science, Yanshan University, Hebei Qinhuang dao, China |
| |
| Abstract: | Abstact:In this paper,we try to apply the particle swarm optiziation(PSO) to solve 0/1 knapsack problem by modifying the model of algorithm properly,In this algorithm,the fitness function is the sum of the object and the all constraint punishment functions.The simulation result indicates that the performance of PSO on knapsack problem is sound and robust. |
| |
| Keywords: | modified particle swarm optiziation knapsack death penalty |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
