| 基于蚁群算法的多维0-1背包问题的研究 |
| |
| 引用本文： | 汪采萍,胡学钢,王会颖.基于蚁群算法的多维0-1背包问题的研究[J].计算机工程与应用,2007,43(30):74-76. |
| |
| 作者姓名： | 汪采萍 胡学钢 王会颖 |
| |
| 作者单位： | [1]合肥工业大学计算机与信息学院,合肥230009 [2]安徽职业技术学院,合肥230051 [3]安徽大学计算机学院,合肥230039 |
| |
| 摘 要： | 系统地阐述了蚁群算法,并对它进行改进、优化。将蚁群算法应用于求解多维0-1背包问题,提出一种求解多维0-1背包问题的算法——多维0-1背包问题蚁群算法。它大大减少了蚁群算法的搜索时间,有效改善了蚁群算法易于过早地收敛于非最优解的缺陷。仿真实验取得了较好的结果。
|
| 关 键 词： | 多维0-1背包问题 蚁群算法 多维0-1背包问题蚁群算法 |
| 文章编号： | 1002-8331（2007）30-0074-03 |
| 修稿时间： | 2007-03 |
On multi-dimension 0-1 knapsack problem based on ant colony algorithm |
| |
| WANG Cai-ping,HU Xue-gang,WANG Hui-ying.On multi-dimension 0-1 knapsack problem based on ant colony algorithm[J].Computer Engineering and Applications,2007,43(30):74-76. |
| |
| Authors: | WANG Cai-ping HU Xue-gang WANG Hui-ying |
| |
| Affiliation: | 1.School of Computer Science and Information,Hefei University of Technology,Heifei 230009,China; 2.Anhui Vocational and Technical College,Heifei 230051 ,China; 3.School of Computer Science, Anhui University, Hefei 230039,China |
| |
| Abstract: | Ant colony algorithm is analyzed and optimized in this article.A new solving 0-1 knapsack problem algorithm,Multi-dimension 0-1 Knapsack Problem Ant Colony Algorithm(MKPACA),is put forward.It greatly reduces the searching time of ant colony algorithm.It also effectively ameliorates the disadvantage of easily falling in local best of ant colony algorithm.The simulation results show that the algorithm is more efficient. |
| |
| Keywords: | multi-dimension 0-1 knapsack problem ant colony algorithm Multi-dimension 0-1 Knapsack Problem Ant Colony Algorithm(MKPACA) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
