Wu C G, Liang Y C, Lee H P, et al. Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining[J]. Physical Review E, 2004, 70(1) : 1 - 13.
[2]
Dimitrijevic V, Saric Z. Efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs[J]. Information Sciences, 1997, 102(1 -4) : 105- 110.
[3]
Lien Y N, Ma E, Wah Benjamin W S. Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem[J]. Information Sciences, 1993, 74(1 -2) : 177- 189.
[4]
TsaiI C F, Tsai C W, Tseng C C. A new hybrid heuristic approach for solving large traveling salesman problem[J]. Information Sciences, 2004, 166(1-4) :67-81.
Snyder L V, Daskin M S. A random-key genetic algorithm for the generalized traveling salesman problem[J]. European .Journal of Operational Research, 2006, 174(1): 1-16.
Blum C, Dorigo M. The hyper-cube Sramework Sor ant colony optimization[J]. IEEE Transactions on System, Man, and Cybernetics Part B:Cybernetics, 2004, 34(2) : 1 161- 1 172.
[11]
Gutjahr W J. A graph-based ant system and its convergence [J]. Future Generation Computer Systems, 2000, 16(8): 873- 888.
[12]
Stutzle T,Hoos H H. Max-min ant system[J]. Future Generation Computer Systems, 2000, 16(8): 889-914.
[13]
Dorigo M, Gambardella L M. Ant colony system: a cooperative learning approach to the traveling salesman problem[J]. IEEE Transaction on Evolutionary, 1997, 10(1) : 53 - 66.
[14]
Rosenkrantz D J, Stearns R E, Lewis II P M. An analysis of several heuristics for the traveling salesman problem[J]. SIAM Joumal on Computing, 1977, 6(3) : 563-581.
