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

基于蚁群优化算法的TSP问题求解 被引量：3

TSP Problem Solution Based on Ant Colony Optimization Algorithm
下载PDF
导出
摘要 蚁群优化算法是受蚂蚁觅食的通行机制的启发而提出的一种群集智能算法.介绍了蚁群优化算法的基本原理,在此基础上实现了蚁群优化算法,应用到TSP问题求解中,并根据启发函数、信息素进行算法性能优化,提高了算法的收敛速度.实验结果表明蚁群算法具有极强的鲁棒性和求最优解的能力,取到了很好的效果. An ant colony optimization algorithm derives heuristically from simulating real ants to seek food. The basic principles of ant colony optimization algorithm are introduced in the article. In the experiments, the algorithm is optimized while being applied to solving TSP problems. The speed of convergence is improved. The experimental results show that this algorithm is extremely robust to solve the optimal solutions of TSP problems. Its application in TSP has achieved good results.
作者 夏小云 李云浩 汪峰
机构地区 江西理工大学信息工程学院
出处 《江西理工大学学报》 CAS 2009年第4期37-39,共3页 Journal of Jiangxi University of Science and Technology
关键词 TSP问题 蚁群优化算法 信息素 可视化 TSP ant colony optimization algorithm pheromone visualization
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献8

二级参考文献39

  • 1Koopmans TC, Berkmann MJ. Assignment problems and the location of economic activities. Econometrica, 1957,25:53-76.
  • 2Sahni S, Gonzalez T. P-Complete approximation problems. Journal of the Association of Computing Machinery, 1976,23(3):555-565.
  • 3Taillard ED. Comparison of iterative searches for the quadratic assignment problem. Location Science, 1995,3:87-105.
  • 4Elshafei AN. Hospital layout as a quadratic assignment problem. Operations Research Quarterly, 1977,28(1):167-179.
  • 5Steinberg L. The backboard wiring problem: A placement algorithm. SIAM Review, 1961,3:37-50.
  • 6Finke G, Burkard RE, Rendl F. Quadratic assignment problems. Annals of Discrete Mathematics, 1987,31:61-82.
  • 7Maniezzo V, Colorni A. The ant system applied to the quadratic assignment problem. IEEE Trans. on Data and Knowledge Engineering, 1999,11(5):769-778.
  • 8Gambardella L, Taillard E, Dorigo M. Ant colonies for the QAP. Journal of the Operations Research Society, 1999, 50:167-176.
  • 9Nissen V. Solving the Quadratic Assignment Problem with Clues from Nature. IEEE Trans. on Neural Networks, 1994,5(1): 66-72.
  • 10Merz P, Freisleben B. A genetic local search approach to the quadratic assignment problem. In: Proc. of the 7th Int'l Conf. of Genetic Algorithms, Morgan Kanffman Publishers, 1997. 465-472.

共引文献103

同被引文献44

  • 1王玲玲,覃运梅.城市直送式配送运输线路优化[J].广西工学院学报,2004,15(4):16-18. 被引量：5
  • 2刘永娟.一种基于蚂蚁算法的QoS路由算法[J].广西工学院学报,2006,17(4):56-59. 被引量：3
  • 3顾军华,谭庆,李娜娜,毛宁.一种新的求解TSP问题智能蚁群优化算法[J].计算机工程与应用,2007,43(25):69-71. 被引量：8
  • 4Dai Sheng-wei,Wang Xin,Li Yan-lin,et al.The PLC-based Control System for Intelligent Garage[C]//2013 Third International Conference on Intelligent System Design and Engineering Applications,Zhang Jia Jie,China:2012:1483-1486.
  • 5Lee Chou-Yuan,Lee Zne-Jung,Lin Shih-Wei,et al.An Enhanced ant Colony Optimization(EACO)Applied to Capacitated Vehicle Routing Problem[C]//Springer Science+Business Media.New York,USA:Applied Intelligence,2010:88-95.
  • 6Wen Zhi-qiang,Cai Zi-xing.Global Path Planning Approach Based on Ant Colony Optimization Algorithm[C]//Journal of Central South Unie versity of Technology.Chang Sha,China:2006:707-712.
  • 7薛山.MATLAB基础教程[M].北京:清华大学出版社,2010.
  • 8ITOH H. The metbod of solving for travelling salesman problem using genetic algorithm with immune adjustment mechanism [ A ]. Traveling Salesman Problem, Theory and Applications[C. Switzerland:Intech Press, 2010:97- 112.
  • 9DAS S, ABRAHAM A, et al. Differentia] evolution using a neighbor- hood - based mutation operator[ J ]. IEEE Transactions on evolution-arycomputation,2009,13(3):526-553.
  • 10Garey M R, Johnson D S. Computers and intractability: A guide to the theory of NPcompleteness[M]. San Francisco: W. H. Freeman Eds, 1979.

引证文献3

二级引证文献4

江西理工大学学报
2009年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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