| 粒子群优化算法求解多选择背包问题 |
| |
| 引用本文： | 陈娟,王志刚,夏慧明.粒子群优化算法求解多选择背包问题[J].价值工程,2012,31(5):197-198. |
| |
| 作者姓名： | 陈娟 王志刚 夏慧明 |
| |
| 作者单位： | 南京师范大学泰州学院数学科学与应用学院,泰州,225300 |
| |
| 基金项目： | 泰州市社会发展计划项目，贵州省教育厅科研项目 |
| |
| 摘 要： | 多选择背包问题是典型的NP难题,建立了多选择背包问题的数学模型,设计了一种粒子群优化算法对其进行求解。通过对其它文献中实例的仿真试验和结果对比,表明了算法对求解多选择背包问题的可行性和有效性。
|
| 关 键 词： | 粒子群优化算法 多选择背包问题 群体智能 |
Particle Swarm Optimization Algorithm for Solving Multiple Choice Knapsack Problem |
| |
| Chen Juan
,
Wang Zhigang
,
Xia Huiming.Particle Swarm Optimization Algorithm for Solving Multiple Choice Knapsack Problem[J].Value Engineering,2012,31(5):197-198. |
| |
| Authors: | Chen Juan Wang Zhigang Xia Huiming |
| |
| Institution: | Chen Juan;Wang Zhigang;Xia Huiming (School of Mathematics,Nanjing Normal University Taizhou College,Taizhou 225300,China) |
| |
| Abstract: | Multi-choice knapsack problem is a typical NP difficulty.The mathematical model of multi-choice knapsack problem is established,and a particle swarm optimization algorithm is designed to solve them.Through the comparison of simulation experiments and results of examples in other literature,it showed that the feasibility and effectiveness of this method for solving the multi-choice knapsack problem. |
| |
| Keywords: | particle swarm optimization algorithm multi-choice knapsack problem swarm intelligence |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
