期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种求解旅行商问题的改进蚁群算法 被引量：5

Improved Ant System Algorithm for Solving Traveling Salesman Problems
在线阅读 下载PDF
导出
摘要 在基本蚁群算法基础上,通过引入信息素的自适应调整策略、限制信息素的范围并动态增加了信息素的局部更新方式．有效地抑制了收敛过程中的停滞现象,提高了算法的搜索能力。TSPLIB的实例求解结果表明了改进算法的有效性。 A novel bionic evolutionary algorithm--the ant system （AS） algorithm can slove many complicated combinatorial optimization problems, especially for traveling salesman problems （TSPs）. An improved AS algorithm is presented by introducing an adaptive strategy of the pheromone, the limited range of the pheromone, and local updating for the pheromone dynamically. The method can effectively restrain stagnation during the iteration, and enhance the search capability. Experimental results for solving some TSPLIB examples are proved to be effective by the improved AS algorithm.
作者 肖健梅 付宇 王锡淮
机构地区 上海海事大学龟气自动化系
出处 《南京航空航天大学学报》 EI CAS CSCD 北大核心 2006年第B07期50-53,共4页 Journal of Nanjing University of Aeronautics & Astronautics
基金 上海市教育委员会科研基金(05FZ06 04FA02)资助项目 上海市重点学科建设基金(T0602)资助项目 上海海事大学重点学科建设基金(XL0105)资助项目。
关键词 蚁群算法 旅行商问题 组合优化 ant system algorithm traveling salesman problem combinatorial optimization
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献7

  • 1Colorni A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies [C]//Proceedings of European Conference on Artificial life. Paris: Elsevier Publishing, 1991: 134-144.
  • 2Dorigo M, Maniezzo V, Colorni A. Ant system: optimization by a colony of cooperating [J]. IEEE Trans on Systems, Man and Cybernetics. Part B:Cybernetics, 1996,26 (1) : 29-41.
  • 3张军英,敖磊,贾江涛,高琳.求解TSP问题的改进蚁群算法[J].西安电子科技大学学报,2005,32(5):681-685. 被引量：25
  • 4Dorigo M, Gambardella 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.
  • 5Stutzle T, Hoos H. Improvements on the ant system: introducing MAX-MIN ant system [C]//Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms. Norwich,UK : Springer Verlag, 1997 : 245-249.
  • 6张航,罗熊.蚁群优化算法的研究现状及研究展望[J].信息与控制,2004,33(3):318-324. 被引量：29
  • 7Tsai H, Yang J, Tsai Y, et al. An evolutionary algorithm for large traveling salesman problems [J].IEEE Trans on Systems, Man and Cybernetics. Part B: Cybernetics, 2004,34(4) :1718-1729.

二级参考文献45

  • 1Stutzle T, Hoos H H. Max-Min Ant System[J]. Future Generation Computer Systems, 2000, 16(8): 889-914.
  • 2Dorigo M, Maniezzo V, Colorni A. Ant System: Optimization by a Colony of Cooperating Agents[J]. IEEE Trans on System, Man, and Cybernetics, 1996, 26(1): 29-41.
  • 3Dorigo M, Gambardella 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.
  • 4Gambardella L M, Dorigo M. Solving Symmetric and Asymmetric TSPs by Ant Colonies[A]. Proc of the 1996 IEEE International Conference on Evolutionary Computation[C]. Nagoya: ICEC'96, 1996. 622-627.
  • 5Dorigo M, Maniezzo V, Colorni A. Positive Feedback as a Search Strategy[R]. [s.l.]: Technical Report 91-016, Dipartimento di Elettronica, Politecnico di Milano, IT, 1991.
  • 6McMullen P R. An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives [ J]. Artificial Intelligence in Engineering, 2001,15(3) :309 -317.
  • 7Coksmi A, Dorigo M, Maniezzo V, et al. Ant system for jobshop scheduling [J]. Belgian Journal Operations Research Statistic Computation Science, 1994,34 (11) :39 - 53.
  • 8Maniezzo V, Carbonaro A. An ant heuristic for the frequency assignment problem [ J ]. Future Generation Computer System,2000,16(8) :927 -935.
  • 9Gambardella L M, Dorigo M. Solving symmetric and asymmetric TSPs by ant colonies [ A]. Proceedings of the IEEE Conference on Evolutionary Computation [ C]. 1996. 622 -627.
  • 10Monarche N, Venturini G, Slimane M. On how pachycondylla apicalis ants suggests a new algorithm [ J ]. Future Generation Computer System, 2000,16 (8) :937 - 946.

共引文献51

同被引文献26

  • 1张军英,敖磊,贾江涛,高琳.求解TSP问题的改进蚁群算法[J].西安电子科技大学学报,2005,32(5):681-685. 被引量：25
  • 2尹晓峰,刘春煌.基于MATLAB的混合型蚁群算法求解旅行商问题[J].铁路计算机应用,2005,14(9):4-7. 被引量：7
  • 3魏蛟龙,岑朝辉.基于蚁群算法的区域覆盖卫星星座优化设计[J].通信学报,2006,27(8):62-66. 被引量：17
  • 4于宏涛,李扬,高立群,张军正.改进蚁群算法在电力线路检修计划中的应用[J].控制工程,2007,14(4):366-368. 被引量：3
  • 5CHEN Hai-Hua, MENG Qing-Chun. Dynamic_time programming based on ant colony algorithm [ J]. Machine Learning and Cybernetics, 2004, 6:3557-3562.
  • 6Potvin J Y, Rousseau J M. An exchange heuristic for routing rroblems with time windows [ J ]. Journal of the Operational Research Society, 1995,46(12) : 1433-1446.
  • 7Mavroidis, Joannis, papaefstathiou, et al. A fast FPGA-based 2-Opt solver for small-scale euclidean traveling salesman problem [ J]. Field Programmable Custom Computing Machines, 2007,7 : 13-22.
  • 8Mavroidis, Ioannis, Papaefstathiou, et al. Hardware implementation of 2-Opt local search algorithm for the traveling salesman problem [ J ]. Rapid System Prototyping, 2007,5:41-47.
  • 9Tsai H, Yang J, Tsai Y, et al. An evolutionary al-gorithm for large traveling salesman problems [ J ]. IEEE Trans on Systems, M and Cybernetics. partB : cybernetics ,2004,34 (4) : 1718-1729.
  • 10Bektas T. The multiple traveling salesman problem : an overview of formulations and solution procedures [ J ]. The International Journal of Management Science, 2006, 34 (3) : 209-219.

引证文献5

二级引证文献8

南京航空航天大学学报
2006年 第B07期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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