计算机应用研究2011，Vol.28Issue(11)：4026-4027,4031,3.DOI:10.3969/j.issn.1001-3695.2011.11.006
0-1背包问题的模糊粒子群算法求解
Solving 0-1 knapsack problem by fuzzy particle swarm optimization
摘要
Abstract
For the weakpoint of fuzzy particle swarm on knapsack problem, this paper gave a new algorithm. Fuzzy particle swarm optimization was a method for solving real problems by using both the fuzzy rules and the characteristics of particle swarm optimization. It successfully solved some 0-1 knapsack problems by fuzzy particle swarm optimization. The computational results show the effectiveness and robustness of the algorithm in numerical simulation.关键词
0-1背包问题/模糊规则/粒子群算法/模糊粒子群算法Key words
0-1 knapsack problem/ fuzzy rules/ particle swarm optimization(PSO) / fuzzy particle swarm optimization(FFSO)分类
信息技术与安全科学引用本文复制引用
柳寅,马良..0-1背包问题的模糊粒子群算法求解[J].计算机应用研究,2011,28(11):4026-4027,4031,3.基金项目
国家自然科学基金资助项目(70871081) （70871081）
上海市重点学科建设资助项目(S30504) （S30504）
上海市研究生创新基金项目(JWCXSL1022) （JWCXSL1022）
