首页 | 本学科首页   官方微博 | 高级检索  
     

基于蚁群优化算法的TSP问题求解
引用本文:夏小云,李云浩,汪峰.基于蚁群优化算法的TSP问题求解[J].南方冶金学院学报,2009,30(4):37-39.
作者姓名:夏小云  李云浩  汪峰
作者单位:江西理工大学信息工程学院,江西,赣州,341000 
摘    要:蚁群优化算法是受蚂蚁觅食的通行机制的启发而提出的一种群集智能算法.介绍了蚁群优化算法的基本原理,在此基础上实现了蚁群优化算法,应用到TSP问题求解中,并根据启发函数、信息素进行算法性能优化,提高了算法的收敛速度.实验结果表明蚁群算法具有极强的鲁棒性和求最优解的能力,取到了很好的效果.

关 键 词:TSP问题  蚁群优化算法  信息素  可视化

TSP Problem Solution Based on Ant Colony Optimization Algorithm
XIA Xiao-yun,LI Yun-hao,WANG Feng.TSP Problem Solution Based on Ant Colony Optimization Algorithm[J].Journal of Southern Institute of Metallurgy,2009,30(4):37-39.
Authors:XIA Xiao-yun  LI Yun-hao  WANG Feng
Affiliation:FacultyofInformation Engineering;Jiangxi UniversityofScience and Technology;Ganzhou 341000;China
Abstract:An ant colonyoptimization algorithmderives heuristicallyfromsimulatingreal ants toseek 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.
Keywords:TSP  ant colony optimization algorithm  pheromone  visualization  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号