计算机工程与应用2011，Vol.47Issue(16)：29-31,3.DOI:10.3778/j.issn.1002-8331.2011.16.009
求解0-1背包问题的量子蚁群算法
Quantum-inspired ant algorithm for solving 0-1 knapsack problem
摘要
Abstract
0-1 knapsack problem is a typical NP-hard problem in combinatorial optimization. A quantum-inspired ant colony algorithm for solving the 0-1 knapsack problem is proposed which is based on the combination of ant colony optimization and quantum computing. In the algorithm,the pheromone is expressed by quantum bits,and quantum rotation gates are used to update the ant pheromone. Series of test instances validate the effectiveness of the algorithm. The proposed algorithm can reduce the searching time and has better performance in reaching the global optimum.关键词
蚁群算法/量子计算/0-1背包问题Key words
ant colony algorithm/quantum computing/0-1 knapsack problem分类
信息技术与安全科学引用本文复制引用
何小锋,马良..求解0-1背包问题的量子蚁群算法[J].计算机工程与应用,2011,47(16):29-31,3.基金项目
国家自然科学基金(the National Natural Science Foundation of China under Grallt No.70871081) （the National Natural Science Foundation of China under Grallt No.70871081）
上海市重点学科建设资助项目(No.S30504). （No.S30504）
