[1]王会颖 贾瑞玉 章义刚 齐平.一种求解0—1背包问题的快速蚁群算法[J].计算机技术与发展,2007,(01):104-107.
　WANG Hui-ying,JIA Rui-yu,ZHANG Yi-gang,et al.A Quick Ant Colony Algorithm of Solving 0 - 1 Knapsack Problem[J].,2007,(01):104-107.
点击复制

一种求解0—1背包问题的快速蚁群算法()

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
期数:
2007年01期
页码:
104-107
栏目:
智能、算法、系统工程
出版日期:
1900-01-01

文章信息/Info

Title:
A Quick Ant Colony Algorithm of Solving 0 - 1 Knapsack Problem
文章编号:
1673-629X（2007）01-0104-04
作者:
王会颖1 贾瑞玉1 章义刚2 齐平1
[1]安徽大学计算机学院[2]合肥学院计算机系
Author(s):
WANG Hui-ying ; JIA Rui-yu;  ZHANG Yi-gang;  QI Ping
[1]School of Computer Scienee,Anhui University[2]Department of Computer Science, Hefei University
关键词:
0—1背包问题; 蚁群算法; 背包问题快速蚁群算法
Keywords:
0- 1 knapsack problem; ant colony algorithm; knapsack quick ant colony algorithm
分类号:
TP301.6
文献标志码:
A
摘要:
0—1背包问题是典型的NP完全问题，且蚁群算法已成功地解决了许多组合优化的难题。因此，文中介绍一种基于蚁群算法求解0—1背包问题的算法，并对此算法进行优化，提出一种求解0—1背包问题的快速蚁群算法。它大大减少了蚁群算法的搜索时间，有效改善了蚁群算法易于过早地收敛于非最优解的缺陷，当物品数较大时，也取得了较好的求解质量。仿真实验取得了较好的结果
Abstract:
0 - 1 knapasck problem is a difficult NP problem. Ant colony algorithm was applied sueeessfully to many hard combinational opti- mization problems. So, an ant colony algorithm of solving 0-1 knapsack problem is introduced. By optimizing it, a quick ant colony algorithm of solving 0 - 1 knapsack problem is presented. 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. When the number of article is big it also can obtain better effects. The simulation results shaw that the algorithm is more efficient

相似文献/References:

[1]段军,张清磊.蚁群算法在LEACH路由协议中的应用[J].计算机技术与发展,2014,24(01):65.
　DUAN Jun,ZHANG Qing-lei.Application of Ant Colony Algorithm Based on LEACH Routing Protocol[J].,2014,24(01):65.
[2]何小娜 逄焕利.基于二维直方图和改进蚁群聚类的图像分割[J].计算机技术与发展,2010,(03):128.
　HE Xiao-na,PANG Huan-li.Image Segmentation Based on Improved Ant Colony Clustering and Two- Dimensional Histogram[J].,2010,(01):128.
[3]熊伟平 曾碧卿.几种仿生优化算法的比较研究[J].计算机技术与发展,2010,(03):9.
　XIONG Wei-ping,ZENG Bi-qing.Studies on Some Bionic Optimization Algorithms[J].,2010,(01):9.
[4]宋世杰 刘高峰 周忠友 卢小亮.基于改进蚁群算法求解最短路径和TSP问题[J].计算机技术与发展,2010,(04):144.
　SONG Shi-jie,LIU Gao-feng,ZHOU Zhong-you,et al.An Improved Ant Colony Algorithm Solving the Shortest Path and TSP Problem[J].,2010,(01):144.
[5]林本强 唐依珠.基于蚁群算法的移动自适应网QoS路由算法[J].计算机技术与发展,2009,(06):9.
　LIN Ben-qiang,TANG Yi-zhu.Ant Colony Algorithm Based Ad Hoc Network QoS Routing Algorithm[J].,2009,(01):9.
[6]古明家 宣士斌 廉侃超 李永胜.基于蚁群和人工鱼群算法融合的QoS路由算法[J].计算机技术与发展,2009,(07):145.
　GU Ming-jia,XUAN Shi-bin,LIAN Kan-chao,et al.QoS Routing Algorithm Based on Combination of Modified Ant Colony Algorithm and Artificial Fish Swarm Algorithm[J].,2009,(01):145.
[7]贾瑞玉 张新建 冯伦阔 李永顺.信息素增量动态更新的改进蚁群算法[J].计算机技术与发展,2009,(09):32.
　JIA Rui-yu,ZHANG Xin-jian,FENG Lun-kuo,et al.Ant Colony Algorithm with Dynamic Pheromones Increment Updating[J].,2009,(01):32.
[8]鲍娜 张德贤 孙傲冰 王飞.基于改进蚁群算法的网格组合拍卖资源分配[J].计算机技术与发展,2009,(10):149.
　BAO Na,ZHANG De-xian,SUN Ao-bing,et al.Research on Resource Allocation of Combinatorial Auction in Grid Based on Improved Ant Colony Algorithm[J].,2009,(01):149.
[9]邓义乔 张代远.蚁群算法在搜索引擎系统中的应用研究[J].计算机技术与发展,2009,(12):21.
　DENG Yi-qiao,ZHANG Dai-yuan.Research and Application of Ant Colony Algorithm in Searching Engine System[J].,2009,(01):21.
[10]段凤玲 李龙澍 曹文婷.具有多态特征和聚类处理的蚁群算法[J].计算机技术与发展,2009,(12):77.
　DUAN Feng-ling,LI Long-shu,CAO Wen-ting.Ant Colony Algorithm with Polymorphism and Clustering Processing[J].,2009,(01):77.

备注/Memo

备注/Memo:
安徽省自然科学基金项目（050460402）;省教育厅科研项目（2005kj056,2006kj088B）;校首届研究生创新项目王会颖（1969-），女，安徽萧县人，硕士研究生，研究方向为智能软件、群体智能
更新日期/Last Update: 1900-01-01