计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (30): 74-76.

• 学术探讨 • 上一篇    下一篇

基于蚁群算法的多维0-1背包问题的研究

汪采萍1,2,胡学钢1,王会颖3   

  1. 1.合肥工业大学 计算机与信息学院,合肥 230009
    2.安徽职业技术学院,合肥 230051
    3.安徽大学 计算机学院,合肥 230039
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-10-21 发布日期:2007-10-21
  • 通讯作者: 汪采萍

On multi-dimension 0-1 knapsack problem based on ant colony algorithm

WANG Cai-ping1,2,HU Xue-gang1,WANG Hui-ying3   

  1. 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
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-10-21 Published:2007-10-21
  • Contact: WANG Cai-ping

PDF

摘要： 系统地阐述了蚁群算法,并对它进行改进、优化。将蚁群算法应用于求解多维0-1背包问题,提出一种求解多维0-1背包问题的算法——多维0-1背包问题蚁群算法。它大大减少了蚁群算法的搜索时间,有效改善了蚁群算法易于过早地收敛于非最优解的缺陷。仿真实验取得了较好的结果。

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.

京ICP备13024262号-1
Copyright © 《计算机工程与应用》编辑部
技术支持：北京玛格泰克科技发展有限公司
总访问量
今日访问
在线人数