| 蚁群算法求解多维0／1背包问题 |
| |
| 引用本文： | 熊伟清,魏平,王小权. 蚁群算法求解多维0／1背包问题[J]. 计算机工程与科学, 2006, 28(10): 78-79 |
| |
| 作者姓名： | 熊伟清 魏平 王小权 |
| |
| 作者单位： | 宁波大学计算机科学与技术研究所,浙江,宁波,315211 |
| |
| 摘 要： | 0／1背包问题是一类典型的组合优化问题，并且是NP-完全的问题，研究它具有很重要的意义。本文针对多维0／1背包问题的特点，设计了二进制编码的有向图，使得蚁群算法可以应用到背包问题上。仿真结果表明，该蚁群算法在求解多维0／1背包问题上的是相当出色的。
|
| 关 键 词： | 蚁群算法 NP-完全问题 整数规划 背包问题 |
| 文章编号： | 1007-130X(2006)010-0078-02 |
| 修稿时间： | 2005-01-20 |
The Ant Colony Algorithm for Solving the Multidimensional 0/1 Knapsack Problem |
| |
| XIONG Wei-qing,WEI Ping,WANG Xiao-quan. The Ant Colony Algorithm for Solving the Multidimensional 0/1 Knapsack Problem[J]. Computer Engineering & Science, 2006, 28(10): 78-79 |
| |
| Authors: | XIONG Wei-qing WEI Ping WANG Xiao-quan |
| |
| Abstract: | The 0/1 Knapsack Problem is of a class of typical combinatorial optimization problems and is NP-complete.It has important meanings to study it. Aiming at the characteristics of the multidimensional 0/1 knapsack problem, a binary coding directed graph is designed, which makes the ant colony algorithm suitable for the Knapsack Problem.The simulation results show that the Ant Colony Algorithm is very excellent in solving the multidimensional 0/1 knapsack problem. |
| |
| Keywords: | ant colony algorithm NP-complete integer programming knapsack problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与科学》浏览原始摘要信息 |
|
点击此处可从《计算机工程与科学》下载全文 |
