摘要
在大规模的TSP求解中,单一的使用蚁群算法会面临优化性能和时间性能这一问题,因此,应先把大规模的TSP按基于距离阈值的近邻聚类分区法划为小规模TSP优化问题来并行求解,再把各子区域中心找一条最佳路径连接起来.
Simply using the ant Colonies Algorithm in handling large - scale TSP may face optimization performance and timeliness. The author puts forward that the large- scale TSP is divided into some small- scale TSP optimization problems parallel untied by the Nearest neighbor classify based on Threshold value, a best route was sought to join each sub - area center again.
出处
《曲靖师范学院学报》
2009年第3期54-57,共4页
Journal of Qujing Normal University
基金
云南省教育厅科学研究基金项目"基于ASP.NET的在线考试系统的设计与实现"(08C0180)
