An ant colony optimization method for generalized TSP problem

被引：137

作者：

Yang, Jinhui ^{[1
]}

Shi, Xiaohu ^{[1
]}

Marchese, Maurizio ^{[2
]}

Liang, Yanchun ^{[1
]}

机构：

[1] Jilin Univ, Key Lab Symbol Computat & Knowledge Engn, Coll Comp Sci & Technol, Minist Educ, Changchun 130012, Peoples R China

[2] Univ Trent, Dept Comp Sci & Informat Engn, I-38050 Povo, TN, Italy

来源：

PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL | 2008年 / 18卷 / 11期

基金：

中国国家自然科学基金;

关键词：

Generalized traveling salesman problem; Ant colony optimization; Mutation; 2-OPT;

D O I：

10.1016/j.pnsc.2008.03.028

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

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. (C) 2008 National Natural Science Foundation of China and Chinese Academy of Sciences. Published by Elsevier Limited and Science in China Press. All rights reserved.

引用

页码：1417 / 1422

页数：6

共 24 条

[1] TRAVELING SALESMAN PROBLEM - A SURVEY [J].