作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 2004, Vol. 30 ›› Issue (16): 35-.

• 论文 • 上一篇    下一篇

蚁群算法求解问题时易产生的误区及对策

徐精明,曹先彬,王煦法   

  1. 中国科学技术大学计算机科学技术系,中国科学技术大学计算机科学技术系,中国科学技术大学计算机科学技术系 合肥 230026 安徽技术师范学院计算机系,蚌埠 233100
  • 发布日期:2004-08-25

Misunderstandings and Counter Measures on Problem Solving by Ant Colony Algorithm

XU Jingming, CAO Xianbin, WANG Xufa   

  • Published:2004-08-25

摘要: 蚁群算法是一种新型的模拟进化算法,具有智能搜索、全局优化、稳健性强、分布式计算等优点。是求解复杂的组合优化问题的有力工具。该文对蚁群算法的应用进行了研究,指出了应用该算法时易产生的几个误区,并提出了相应的对策。

关键词: 蚁群算法, TSP, 误区, 对策

Abstract: Ant colony algorithm is a novel simulated evolutionary algorithm ,which has many advantages ,such as intelligent search,global optimization ,robusticity,distributed computation.It provides a very useful tool to solve complex combinatorial optimization problems. In this paper, the applications of ant colony algorithm are discussed, and some misunderstandings frequently coming from the application of the algorithm are designated. Furthermore, the paper gives some corresponding counter measures.

中图分类号: