期刊文献+

基于加速寻径收敛的改进型蚁群算法 被引量:5

Improved ant colony optimization algorithm based on accelerating time converging of routing
下载PDF
导出
摘要 提出了一种基于基本蚁群算法的有节点信息素更新和记忆功能的算法模型;仿真结果表明,基于改进的蚁群算法模型在寻找最优解时表现出很高的效率,明显地优于现有的启发式算法的解,是一种有效的算法。 Basing on these problems,a new algorithm of ant colony algorithm is proposed.In this new algorithm,two new proposals are introduced into this reforming algorithm:comparing to the original ACO,propose the ideal of updating pheromone on these nodes;Basing on this new ACO,the simulation results indicate a better throughout.About the algorithm running time,the improved proposals accelerate time converging of routing and improved efficiency of algorithm.
出处 《计算机工程与应用》 CSCD 北大核心 2007年第24期75-77,共3页 Computer Engineering and Applications
关键词 寻径基本蚁群算法旅行商问题(TSP)信息素路径 routing Ant Colony Algorithm(ACO) Traveling Salesman Problem(TSP) pheromone paths
  • 相关文献

参考文献11

  • 1Kemal Akkaya,Mohamed younis.A survey on routing protocols for wirless sensor networks[J].Ad Hoc Network Jouranl,2005,3 (3):325-345.
  • 2Gutjahr W J.ACO algorithms with guaranteed convergence to the optimal solution[J].Information Processing Letters,2002,82(3):145-153.
  • 3Cambardella L M,Dorigo M.An ant colony system hybridized with a new local search for the sequential ordering problem[J].INFORMS Journal on Computing,2000,12(3):237-255.
  • 4Gambardella L M,Mastrolilli M,Rizzoli A E,et al.An integrated approach to the optimization of an intermodal terminal based on efficient resource allocation and scheduling[J].Journal of Intelligent Manufacturing,2001,12(5/6):521-534.
  • 5Dorigo M,Bonabeau E,Theraulaz G.Ant algorithms and stigmergy[J].Future Generation Computer Systems,2000,16(1):851-871.
  • 6Zhao Y W,Wu B,Jiang L,et al.Study of the optimizing of physical distribution routing problem based on genetic algorithm[J].Computer Integrated Manufacturing Systems,2004,10(3):303-306.
  • 7Bell J E,McMullen P R.Ant colony optimization techniques for the vehicle routing problem[J].Advanced Engineering Informatics,2004,18(1):47-76.
  • 8Stüezle T,Dorigo M.A short convergence proof for a class of ant colony optimization algorithms[J].IEEE Transactions on Evolutionary Computation,2002,6(4):358-365.
  • 9Baker B M,Ayechew M A.A genetic algorithm for the vehicle routing problem[J].Computers & Operations Research,2003,30(5):787-800.
  • 10Reimann M,Doerner K,Richard F H.D-Ants:savings based ants divide and conquer the vehicle routing problem[J].Computers & Operations Research,2004,31(2):563-591.

同被引文献16

  • 1宁爱兵,马良,熊小华.基于复杂适应系统的蚂蚁群体智能研究[J].微计算机信息,2008,24(1):265-267. 被引量:7
  • 2张志民,张小娟,李明华,胡小兵.一种引入奖励与惩罚机制的蚁群算法[J].计算机仿真,2006,23(7):161-163. 被引量:11
  • 3张毅,梁艳春.基于选路优化的改进蚁群算法[J].计算机工程与应用,2007,43(2):60-63. 被引量:14
  • 4Colorni A, Dorigo M, Maniezzo V. The Ant System:Optimization by a Colony of Cooperating Agents[J ]. IEEE Transactions on Systems, 1996,26(1):1 -13.
  • 5Bullnheimer B,Hartl R F,Strauss C. A New Rankbased Version of the Ant System: A Computational Study [ R ]. Vienna: Institute of Management Science, University of Vienna, 1997.
  • 6Dorigo M, Cambardella L M. A Cooperative Learning Approach to the Traveling Salesman Problem [ J ]. IEEE Transactions on Evolutionary Computation, 1997,1 ( 1 ) :53 -66.
  • 7申春 彭秀增 罗凡 等.基于方向启发因子的蚁群算法.计算机科学,2006,33(8):175-176.
  • 8Colorni A,Dorigo M,Maniezzo V. The Ant System:Optimization by a Colony of Cooperating Agents[J]. IEEE Trans.on Systems,1996,26(1):1 - 13.
  • 9Colorni A,Dorigo M, Maniezzo V, et al. Distributed Optimization by Ant Colonies [A]. Proceedings of ECAL91 (European-Conference on Artificial Life) [C]. Paris, 1991:134 - 142.
  • 10Dorigo M,Cgmbardella L M.Ant colony system:A cooperative learning approach to the traveling salesman problem[J].IEEE Trans on Evolutionary Computation, 1997,1 ( 1 ) :53-66.

引证文献5

二级引证文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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