期刊文献+

基于蚁群算法的TSP问题研究与实现 被引量:2

下载PDF
导出
摘要 旅行商问题(TSP问题)是运筹学中一个十分典型的组合优化问题。TSP问题看似简单,但是解决起来十分复杂、困难,采用传统的、一般的算法是很难求出问题的最优解的。蚁群算法是根据蚂蚁寻找食物的行为模拟出来的新型仿生算法,可以用于解决复杂的组合优化问题。
作者 王芳
出处 《科学中国人》 2014年第2X期1-1,共1页 Scientific Chinese
  • 相关文献

参考文献3

二级参考文献16

  • 1Colomi A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies[A]. Proc.of the First European Conference on Artificial Life[C]. Paris:Elsevier Publishing,1991:134~142.
  • 2COLORM A,DORIGO M,MINIEZZO V.Distributed optimization by ant colonies[C].Proceeding of the First European Conference on Artificial Life.Paris France:Elsevier Publishing, 1991 : 134-142.
  • 3DORIGO M,GAMBARDELLA L M.Ant colony system: a cooperative learning approach to the traveling salesman problem [J].IEEE Transactions on Evolutionary Computation,1997,1(1): 53-66.
  • 4ZHONGZHEN YANG,BIN YU,CHUNTIAN CHENG. A parallel ant colony algorithm for bus network optimization[J]. Computer-Aid Civil and Infrastructure Engineering, 2007,22(1): 44-55.
  • 5ATTIRATANASUNTHRON NATTAPAT, FAKCHAROENPHOL JITTAT.A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs[J].Information Processing Letters,2008,105(3):88-92.
  • 6COLOMI A, DORIGO M, MANIEZZO V. Distributed optimization by ant Colonies[ C]//Proc. 1 st European Coof. Artificial, Pans, France : Elsevier, 1991 : 134 - 142.
  • 7COLOMI A. DORIGO M, MANIEZZO V. An investigation of some properties of an ant algorithm [ C ]//Proceeding of parallel Problem Solving from Nature ( PPSN ), France : Elsevier, 1992 : 509 - 520.
  • 8COLOMI A. DORIGO M, MANIEZZO V, et al. Ant system for job - shop scheduling [ J ]. Belgian Journal of Operations Statistics and Computer Science, 1994,34 ( 1 ) :39 - 53.
  • 9DORIGO M, CARO G D, GAMBARDELLA L M. Ant algorithms for discrete optimization [ J]. Artificial Life, 1999, 5 (2) :137 -172.
  • 10夏立民,王华,窦倩,陈玲.基于蚁群算法的最优路径选择问题的研究[J].计算机工程与设计,2007,28(16):3957-3959. 被引量:18

共引文献39

同被引文献19

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部