An ant colony optimization method for generalized TSP problem  

作　　者：Jinhui Yang Xiaohu Shi Maurizio Marchese Yanchun Liang 

机构地区：[1]College of Computer Science and Technology, Jilin University, Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education, Changehun 130012, China [2]Department of lnformation Engineering and Computer Science, University of Trento, Via Sommarive 14, 38050 Povo （TN）, Italy

出　　处：《Progress in Natural Science:Materials International》2008年第11期1417-1422,共6页自然科学进展·国际材料（英文版）

基　　金：supported by National Natural Science Foundation of China(Grant Nos.60673023,60433020,60703025,10501017);the European Commission for TH/Asia Link/010(111084)

摘　　要：Focused on a variation of the euclidean traveling salesman problem （TSP）, namely, the generalized traveling salesman problem （GTSP）, this paper extends the ant colony optimization method from TSP to this field. By considering the group influence, an improved method is further improved. To avoid locking into local minima, a mutation process and a local searching technique are also introduced into this method. Numerical results show that the proposed method can deal with the GTSP problems fairly well, and the developed mutation process and local search technique are effective.

关 键 词：Generalized traveling salesman problem Ant colony optimization MUTATION 2-OPT 

分 类 号：O224[理学—运筹学与控制论]