1Omar M.Sallabi and Younis EI-Haddad,An Improved Genetic Algorithm to Solve the Traveling Salesman Problem,world Academy of Science,Engineering and Technolog52,pp.471-474,2009.
2Sangit Chatterjee and Cecilia,Genetic algorithms and traveling salesman problems,European Journal of Operational Research93,pp.490-5101996.
3WIS.Kirkpatrick,C.Gelatt,Jr.and M.Vecchi,Optimization by simulated annealing,Science220pp.671-680,1983.
4Dorigo M,Gambardella L M.Ant colony system:A cooperative learning approach to the traveling salesman problem[J].IEEE Trans Ev olutionary Computation,1997,1(1):53-66.
5Marco Dorigo,The Ant System:Optimization by a colony of cooperating agents[J].IEEE Transactions on Systems,1996,pp.1-13.
6Huajin Tang and K.C.Tan,A Columnar Competitive Model for Solving Combinatorial Optimization Problems.IEEE TRANSACTIONS ON NEURAL NETWORKS,VOL.15,NO.6,pp.1568-1573,NOVEMBER2004.
7Paulo Henrique Siqueira and Maria Teresinha Arns Steiner,A new approach to solve the traveling salesman problem.Neurocomputing70pp.1013-1021,2007.
8Chuangyin Dang,A globally convergent Lagrange and barrier function iterative algorithm for the traveling salesman problem.Neural Networks 14,pp.217-230,2001.
9Leyuan Shi and Sigurdur Olafsson,New parallel randomized algorithms for the traveling salesman problem,Computers&Operations Research 26pp.371-3941999.
10S.Arora,Nearly linear time approximation sch mes for Euclidean TSP and other geometric problems[J].Proceedings of37th Annual Symposium Foundation of Computer Science,Oct.1997.