期刊文献+

基于双信息素的MMAS在TSP中的应用 被引量:1

MMAS based on double pheromones and its application on TSP problem
在线阅读 下载PDF
导出
摘要 正反馈机制是蚁群算法的一个重要特征,它通过信息素的累积作用对蚂蚁的寻径产生诱导,从而吸引更多的蚂蚁,加快了发现较优解的速度,但是同时也为陷入局部最优埋下了隐患,在此基础上,引入了负反馈机制,通过排斥信息素来实现。实验表明,负反馈机制的应用增强了算法发现最优解的能力,是实际可行的。 The positive feedback is one of main characteristics of Ant Colony Optimization (ACO),it works through the cumulation of the pheromone by which the ant's behavior is biased,then attracts more ants to choose this path.The positive feedback benefits for the rapid discovery of good solutions,but it makes the local optima possible,so,we propose the negative feedback which works through the repulsion pheromone.Experimental results show that the application of negative feedback improves the algorithm's ability to find the good solutions and it is feasible.
作者 王伟 王锦彪
出处 《计算机工程与应用》 CSCD 北大核心 2008年第28期44-46,共3页 Computer Engineering and Applications
基金 国家自然科学基金No.60472121~~
关键词 蚁群算法 正反馈 负反馈 吸引信息素 排斥信息素 Ant Colony Optimization(ACO ) positive feedback negative feedback attraction pheromone repulsion pheromone
  • 相关文献

参考文献9

  • 1Colorni A,Dorigo M,Maniezzo V,et al.Distributed optimization by ant colonies[C]//Proceedings of ECAL'91 ,European Conference on Artificial Life.Paris:Elsevier Publishing, 1991 : 134-142.
  • 2Dorigo M, Maniezzo V, Colomi A.Ant system : optimization by a colony cooperating Agents[J].IEEE Transactions on Systems,Man, and Cybernetics Part B, 1996,26( 1 ) : 29-41.
  • 3Dorigo M.Optimization,learning and natural algorithms(in Italian)[D]. Dipartimento di Elettronica,Politecnico di Milano,Italy,1992.
  • 4Gambardella L M,Dorigo M.Ant-Q:a reinforcement learning approach to the traveling salesman problem[C]//Prieditis A,Russell S A.Proceedings of the 12th International Conference on Machine Learning,ML-95.USA:Morgan Kaufmann Publishers, 1995:252-260.
  • 5Dorigo M,Gambardella LM.Ant colonies for the traveling salesman problem[J].BioSystems, 1997,43 ( 2 ) : 73- 81.
  • 6Stutzle T,Hoos H.MAX-MIN Ant System[J].Journal of Future General Computer System, 2001,16(8) : 889-914.
  • 7Bullnheimer B,Hartl RF,Strauss C.A new rank based version of the ant system:a computational study[J].Central European Journal of Operations Research, 1999,7( 1 ) : 25-38.
  • 8Hoyt E.蚂蚁帝国[M].李若溪,译.海口:海南出版社,2002:76-87.
  • 9王锦彪.狭义TSP几何解的演化逻辑与算法[J].计算机工程,2005,31(14):77-79. 被引量:6

二级参考文献3

  • 1Arora S. Polynomial Time Approximation Schemes for Euclid- ean TSP and Other Geometric Problems. In: Proceedings of the37^th Annual IEEE Symposium on Foundations of Computer Science. http://citeseer.nj.nec.com/arlicle /arora96polynomial.html. 1996
  • 2Graham R L. An Efficient Algorithm for Determine the Convex Hull of a Finite Linear Set. Information Processing Letters, 1972, 1:132-133
  • 3邹鹏,周智,陈国良,顾钧.求解TSP问题的多级归约算法[J].软件学报,2003,14(1):35-42. 被引量:60

共引文献5

同被引文献13

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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