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

基于蚁群算法的TSP的仿真与研究
引用本文:张宏达,郑全弟.基于蚁群算法的TSP的仿真与研究[J].航空计算技术,2005,35(4):103-106.
作者姓名:张宏达  郑全弟
作者单位:空军工程大学,导弹学院,陕西,三原,713800;空军工程大学,导弹学院,陕西,三原,713800
摘    要:对于旅行商问题的研究始于19世纪,从20世纪中叶开始随着计算机技术的发展而不断发展。蚁群算法是一种新型的优化算法,于20世纪90年代提出,最早成功应用于解决旅行商问题。研究表明,蚁群算法有着极强的鲁棒性发现较好解的能力。通过编程实现了用蚁群算法解决旅行商问题,通过仿真实验研究了各参数对算法的影响。

关 键 词:仿真  蚁群算法  旅行商问题  优化
文章编号:1671-654X(2005)04-0103-04
修稿时间:2005年7月1日

Simulation and Study on TSP Based on Ant Colony Algorithm
ZHANG Hong-da,ZHENG Quan-di.Simulation and Study on TSP Based on Ant Colony Algorithm[J].Aeronautical Computer Technique,2005,35(4):103-106.
Authors:ZHANG Hong-da  ZHENG Quan-di
Abstract:Study on TSP begun at early 1800s'and it had been developing continuously with the development of computer technology since 1950s'.Ant colony algorithm is a new kind of optimization algorithm;it was firstly brought forward in 1990s' and was applied in TSP successfully.It has been proved that it is a robust algorithm and has the powerful ability to find more preferable solutions.Programming is done to realize TSP based on ant colony algorithm.The effects that the parameters of the algorithm have on the algorithm have been researched through simulation and repeated experiments.
Keywords:simulation  ant colony algorithm  traveling salesman problem  optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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