In this paper,an ant algorithm based on a geometry structure of TSP is presented to solve these shortcomings,constructing candidate list by quadrant neighbor list and initializing pheromone table by dual quadrant neighbor method.

• 本文提出了一种基于旅行商问题(TSP)几何结构的蚁群算法,利用象限邻居表构造候选集和对偶限象邻居的方法初始化信息素,用以克服上述缺陷。