References

• Aiyer , SVB , Niranjan , M and Fallside , F . 1990 . A theoretical investigation into the performance of the Hopfield model . IEEE Transactions on Neural Networks , 1 : 204 – 215 .
   PubMedGoogle Scholar
• Angéniol , B , Vaubois , C and Texier , JYL . 1988 . Self-organizing feature maps and the travelling salesman problem . Neural Networks , 1 : 298 – 293 .
   Web of Science ®Google Scholar
• Aras , N , Oommen , BJ and Altinel , IK . 1999 . The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem . Neural Networks , 12 : 1273 – 1284 .
   PubMed Web of Science ®Google Scholar
• Arbter , K , Snyder , WE , Burkhardt , H and Hirzinger , G . 1990 . Application of affine-invariant Fourier descriptors to recognition of 3-D objects . IEEE Transactions on Pattern Analysis and Machine Intelligence , 12 : 640 – 647 .
   Web of Science ®Google Scholar
• Bentley , JJ . 1992 . Fast algorithms for geometric traveling salesman problems . Operations Research Society of America , 4 : 387 – 411 .
   Google Scholar
• Blum , C and Dorigo , M . 2005 . Search bias in ant colony optimization: on the role of competition-balanced systems . IEEE Transactions on Evolutionary Computation , 9 : 159 – 174 .
   Web of Science ®Google Scholar
• Brill, E.L., “Character recognition via Fourier descriptors,” presented at the WESCON Technical Papers, Jan.9, Los Angeles, CA (1968)
   Google Scholar
• Burke , LI and Damany , P . 1992 . The guilty net for the traveling salesman problem . Computers and Operations Research , 19 : 255 – 265 .
   Web of Science ®Google Scholar
• Cook , W and Seymour , P . 2003 . Tour merging via branch-decomposition . INFORMS Journal on Computing , 15 : 233 – 248 .
   Web of Science ®Google Scholar
• Dorigo , M and Gambardella , LM . 1997 . Ant colony system: a cooperative learning approach to the traveling salesman problem . IEEE Transactions on Evolutionary Computation , 1 : 53 – 66 .
   Google Scholar
• Fischer, T. and P. Merz, “Embedding a chained Lin-Kernighan algorithm into a distributed algorithm,” Technical Report, Department of Computer Science, University of Kaiserslautern, 1–24 (2004)
   Google Scholar
• Fischer, T. and P. Merz, A distributed chained Lin-Kernighan algorithm for TSP problems, Proceedings of the 19th International Parallel and Distributed Processing Symposium, Apr.4–8, Denver, USA, 1–10 (2005)
   Google Scholar
• Fischer , T and Merz , P . 2007 . “ Embedding a chained Lin-Kernighan algorithm into a distributed algorithm ” . In Operations Research Computer Science Interfaces , Edited by: Doerner , KF , Gendreau , M , Greistorfer , P , Gutjahr , WJ , Hartl , RF and Reimann , M . 277 – 295 . Germany : Springer .
   Google Scholar
• Ghaziri , H and Osman , IH . 2003 . A neural network algorithm for the traveling salesman problem with backhauls . Computers and Industrial Engineering , 44 : 267 – 281 .
   Web of Science ®Google Scholar
• Gonzalez , RC and Woods , RE . 2008 . Digital Image Processing , Upper Saddle River, NJ : Pearson Prentice Hall .
   Google Scholar
• Granlund , GH . 1972 . Fourier processing for hand printed character recognition . IEEE Transactions Computers , 21 : 195 – 201 .
   Web of Science ®Google Scholar
• Gutjahr , WJ . 2008 . First steps to the runtime complexity analysis of ant colony optimization . Computers and Operations Research , 35 : 2711 – 2727 .
   Web of Science ®Google Scholar
• Helsgaun , K . 2000 . An effective implementation of the Lin-Kernighan traveling salesman heuristic . European Journal of Operation Research , 126 : 106 – 130 .
   Web of Science ®Google Scholar
• Hopfield , JJ and Tank , DW . 1985 . Neural computation of decisions in optimization problems . Biological Cybernetics , 52 : 141 – 152 .
   PubMed Web of Science ®Google Scholar
• Johnson , DS and McGeoch , LA . 1997 . “ The traveling salesman problem: a case study in local optimization ” . In Local Search in Combinatorial Optimization , Edited by: Aarts , EH and Lenstra , JK . 215 – 310 . New York : John Wiley and Sons, Balzer Scientific Publishers .
   Google Scholar
• Johnson , DS and McGeoch , LA . 2002 . “ Experimental analysis of heuristics for the STSP ” . In The Traveling Salesman Problem and Its Variations , Edited by: Gutin , G and Punnen , AP . 369 – 443 . The Netherlands : Kluwer Academic Publishers .
   Google Scholar
• Kohonen , T . 1990 . The self-organizing map . Proceedings of the IEEE , 78 : 1464 – 1480 .
   Web of Science ®Google Scholar
• Lin , CS and Hwang , CL . 1987 . New forms of shape invariants from elliptic Fourier descriptors . Pattern Recognition , 20 : 535 – 545 .
   Web of Science ®Google Scholar
• Lin , C-S and Jungthirapanich , C . 1990 . Invariants of three-dimensional contours . Pattern Recognition , 23 : 833 – 842 .
   Web of Science ®Google Scholar
• Lin , S and Kernighan , GW . 1973 . An effective heuristic algorithm for the traveling-salesman problem . Operations Research , 21 : 498 – 516 .
   Web of Science ®Google Scholar
• Martin , OC and Otto , SW . 1996 . Combining simulated annealing with local search heuristics . Annals of Operations Research , 63 : 57 – 75 .
   Web of Science ®Google Scholar
• Martin , OC , Otto , SW and Felten , EW . 1991 . Large-step Markov chains for the traveling salesman problem . Complex Systems , 5 : 299 – 326 .
   Google Scholar
• Modares , A , Somhom , S and Enkawa , T . 1999 . A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems . International Transactions in Operational Research , 6 : 591 – 606 .
   Google Scholar
• Papadimitriou , CH . 1978 . The Euclidean travelling salesman problem is NP-complete . Theoretical Computer Science , 4 : 237 – 244 .
   Google Scholar
• Reinelt , G . 1991 . TSPLIB-a traveling salesman problem library . ORSA Journal on Computing , 3 : 376 – 384 .
   Google Scholar
• Sengoku , H and Yoshihara , I . 1993 . A fast TSP solution using genetic algorithm . 46th National Convention of the Information Processing Society of Japan , 8D-4
   Google Scholar
• Strang , G . 1986 . Introduction to Applied Mathematics , MA : Wellesley-Cambridge Press .
   Google Scholar
• Zahn , CT and Roskies , RZ . 1972 . Fourier descriptors for plane closed curves . IEEE Transactions on Computers , 21 : 269 – 281 .
   Web of Science ®Google Scholar