小窗口蚁群算法解决旅行商问题的应用与分析  

The Applications and Analyses of The ant group algorithm on Little Windows solving the TSP

作　　者：汤文菊[1] 刘伟洁[1] 邱望仁[1] 

机构地区：[1]景德镇陶瓷学院信息工程学院,江西景德镇333001

出　　处：《科技信息》2007年第35期73-74,共2页Science & Technology Information

摘　　要：本文先介绍基本蚁群算法模型,并应用此法对TSP(旅行商问题)进行了求解。然后运用小窗口蚁群算法解决TSP问题,通过与基本蚁群算法的比较,认为小窗口蚁群算法无论是在解的优化上还是运行时间上都优基本蚁群算法。This article firstly introduces the basic ant group algorithm, and applying it to solve TSP. Subsequently the ant group algorithm on little Windows is applied to solve TSP. Finally the article drew a conclusion which the ant group algorithm on little Windows is more excellent than the basic ant group algorithm both on optimizing the solution and on solving time by contrast with the basic ant group algorithm.

关 键 词：小窗口蚁群算法 TSP(旅行商问题) 应用 分析 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]