1[1]Carpaneto G,Toth P.Some New Branching and Bounding Criteria for the Asymmetric Traveling Salesman Problem[J].Management Science,1980,(26).
2[2]Dantzig G B.Solution of a Large Scale Traveling Salesman Problem[J].Operations Research,1954,(2).
3[3]Bellman R.Dynamic Programming Treatment of the Traveling Salesman Problem[J],J.ACM,1962,(9).
4[4]Grefenstette J J,Gopal R,Rosmaita B,et al.Genetic Algorithms for Traveling Salesman Problem[A].In:Proceedings of an International Conference on Genetic Algorithms and Their Applications[C],1985.
6[6]Cheng-Fa Tsai,Chun-Wei Tsai,Ching-Chang Tseng.A new hybrid heuristic approach for solving large traveling salesman problem[J].Information Sciences,2004,(166).
7[8]Gregory Gutin,Anders Yeo.Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number[J].Discrete Applied Mathematics,2002,(119).
8[9]E.M.Cochrane,J.E.Beaaley.The co-adaptive neural network approach to the Euclidean Traveling Salesman Problem[J].Neural Networks,2003,(16).
9[10]V.Deineko.New exponential neighborhood for polynomially solvable TSPs[J].Electronic Notes in Discrete Mathematics.2004,(17).
10[11]Hans-Joachim Bǒckenhauer,Juraj Hromkovi.c,RalfKlasing,et al.Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem[J].Theoretical Computer Science,2002,(285).
3HUANG Lan , ZHOU Chunguang and WANG Kangping(College of Computer Science and Technology, Jilin University, Changchun 130012, China).Hybrid ant colony algorithm for traveling salesman problem[J].Progress in Natural Science:Materials International,2003,13(4):295-299. 被引量：15
7VARELA G N, SINCLAIR M C. Ant colony optimization for virtual--wavelength --path routing and wavelength allocation[A]. Proceedings of the 1999 Congress on Evolutionary Computation [C]. Washington DC: IEEE, 1999. 1809--1816.
8BAUER A, BULLNHEIMER B, HARTL R F, STRAUSSC. An ant colony optimization approach for the single machine total tardiness problem[A]. Proceedings of the 1999 Congresson Evolutionary Computation [C]. Washington DC: IEEE,1999. 1445-- 1450.
9KRIEGER MICHAEL J B, et al. Ant--like task allocation and recruitment in cooperative robots[J]. Nature, 2000,406:39--42.
10HOOGEVEEN J A, LENSTRA J K, VELTMAN B. Preemptive scheduling in a two--stage multiprocessor flow shop is NP--hard[J]. European Journal of Operational Research, 1996,89(1): 172--175.
