内蒙古民族大学学报（自然科学版）Issue(2)：150-152,3.
基于候选集和分段优化的蚁群算法对TSP问题的求解
Ant Colony Algorithm Based on Candidate Set and Partitioned Optimization for Solving the TSP Problem
摘要
Abstract
Traditional ant colony algorithm for solving large scale traveling salesman problem(TSP)encounters the dual challenges of time and precision. For these shortcomings, this paper proposes an algorithm for TSP problem. This algorithm establishes a candidate city set based on Delaunay triangulation for every city. And then optimizes the opti-mal path to improve the quality of solution. The experiments show that compared with traditional ant colony algorithm, the proposed algorithm improves the convergence speed and solving efficiency.关键词
蚁群算法/Delaunay三角剖分/分段优化/旅行商问题Key words
Ant colony algorithm/Delaunay triangulation/Partitioned optimization/Traveling salesman problem分类
信息技术与安全科学引用本文复制引用
高晶英,姜静清,宋初一,裴志利..基于候选集和分段优化的蚁群算法对TSP问题的求解[J].内蒙古民族大学学报（自然科学版）,2014,(2):150-152,3.基金项目
国家自然科学基金资助项目（61163034,61373067）；内蒙古自然科学基金资助项目 （）
