A Novel Ant Colony System with Double Pheromones for the Generalized TSP

摘要：

The Generalized Traveling Salesman Problem (GTSP) is an extension of the classical traveling salesman problem and has many interesting applications. The GTSP is known to be an NP-hard problem. In this paper we present a novel ant colony system with double pheromones for solving the GTSP. Meanwhile, to avoid locking into local minima, an effectively local searching technique and a novel mutation process are also introduced into this method according to the characteristic of the GTSP. Experimental results on numerous TSPlib instances show that the proposed method is significantly superior to the state-of-theart methods.

关键词： double pheromones GTSP ACS local searching mutation process

作者: MOU Lian-Ming

作者单位: Key Laboratory of Numerical Simulation of Sichuan Province, Neijiang Normal University, Sichuan, 641112, P.R. China

会议类型: 国际会议

会议名称: 2011 Seventh International Conference on Natural Computation(第七届自然计算国际会议 ICNC 2011)

会议地点: 上海

会议语种:英文

页码: 1949-1954

在线出版日期: 2011-07-26（万方平台首次上网日期，不代表论文的发表时间）