| 求解0-1背包问题的细菌觅食算法 |
| |
| 引用本文： | 戴秋萍,马良,郗莹. 求解0-1背包问题的细菌觅食算法[J]. 数学的实践与认识, 2013, 43(3) |
| |
| 作者姓名： | 戴秋萍 马良 郗莹 |
| |
| 作者单位： | 上海理工大学管理学院,上海,200093 |
| |
| 基金项目： | 国家自然科学基金，上海市重点学科建设项目资助，上海市研究生创新基金 |
| |
| 摘 要： | 0-1背包问题是组合优化中的一个典型NP难题,介于其具有广泛的实际应用,有效的解决该问题具有非常重要的意义.给出了一种新的群智能算法—细菌觅食算法,对0-1背包问题进行求解.经模拟仿真验证了该算法的有效性,并将其结果与其他方法进行对比分析.
|
| 关 键 词： | 0-1背包问题 细菌觅食 优化算法 |
Bacterial Foraging Algorithm for 0-1 Knapsack Problem |
| |
| DAI Qiu-ping , MA Liang , XI Ying. Bacterial Foraging Algorithm for 0-1 Knapsack Problem[J]. Mathematics in Practice and Theory, 2013, 43(3) |
| |
| Authors: | DAI Qiu-ping MA Liang XI Ying |
| |
| Abstract: | 0-1 knapsack problem is a classical N-P Problem in combinatorial optimization which has been used in many fields.It has great significance in solving the problem efficiently. This paper introduces a new optimization algorithm—Bacterial foraging optimization(BFO) to solve the 0-1 knapsack problem.Through numerical simulations and comparisons with that of other algorithms,it shows the effectiveness and validity of the method. |
| |
| Keywords: | 0-1 knapsack problem Bacterial foraging Optimization Algorithm |
| 本文献已被 万方数据 等数据库收录！ |
|
