The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem

In this paper we consider the Euclidean Travelling Salesman Problem (ETSP). This is the problem of finding the shortest tour around a number of cities where the cities correspond to points in the Euclidean plane and the distances between cities are given by the usual Euclidean distance metric. We present a review of the literature with respect to neural network (NN) approaches for the ETSP, and the computational results that have been reported. Based upon this review we highlight two areas that are, in our judgement, currently neglected/lacking in the literature. These are: failure to make significant use of publicly available ETSP test problems in computational work, failure to address co-operation between neurons. Drawing upon our literature survey this paper presents a new Self-Organising NN approach, called the Co-Adaptive Net, which involves not just unsupervised learning to train neurons, but also allows neurons to co-operate and compete amongst themselves depending on their situation. Our Co-Adaptive Net algorithm also includes a number of algorithmic mechanisms that, based upon our literature review, we consider to have contributed to the computational success of previous algorithms. Results for 91 publicly available standard ETSP's are presented in this paper. The largest of these problems involves 85,900 cities. This paper presents: the most extensive computational evaluation of any NN approach on publicly available ETSP test problems that has been made to date in the literature, a NN approach that performs better, with respect to solution quality and/or computation time, than other NN approaches given previously in the literature. Drawing upon computational results produced as a result of the DIMACS TSP Challenge, we highlight the fact that none of the current NN approaches for the ETSP can compete with state of the art Operations Research heuristics. We discuss why we consider continuing to study and develop NN approaches for the ETSP to be of value.

[1]  Gerhard Reinelt,et al.  The travelling salesman problem , 1995 .

[2]  M. Budinich.  Neural networks for NP-complete problems , 1997 .

[3]  Mengkang Peng,et al.  An Investigation into the Improvement of Local Minima of the Hopfield Network , 1996, Neural Networks.

[4]  Shara Amin.  A self-organised travelling salesman , 2005, Neural Computing & Applications.

[5]  Masaki Kobayashi,et al.  Cooperative updating in the Hopfield model , 2001, IEEE Trans. Neural Networks.

[6]  J. A. Casas,et al.  A natural solution to the μ problem , 1993 .

[7]  M. Al-Mulhem,et al.  Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[8]  Tao Xiong,et al.  A combined SVM and LDA approach for classification , 2005, Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005..

[9]  B. John Oommen,et al.  A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE , 2000, ECAI.

[10]  Laura Burke,et al.  "Conscientious" neural nets for tour construction in the traveling salesman problem: the vigilant net , 1996, Comput. Oper. Res..

[11]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[12]  T. Kohonen.  Self-organized formation of topographically correct feature maps , 1982 .

[13]  Martin W. Simmen.  Parameter Sensitivity of the Elastic Net Approach to the Traveling Salesman Problem , 1991, Neural Computation.

[14]  Carsten Peterson,et al.  Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem , 1990, Neural Computation.

[15]  Yasuo Matsuyama,et al.  Self-organizing neural networks and various euclidean traveling salesman problems , 1992, Systems and Computers in Japan.

[16]  Yasuo Matsuyama,et al.  Competitive self-organization and combinatorial optimization: applications to traveling salesman problem , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[17]  Rudolf F. Albrecht,et al.  Artificial Neural Nets and Genetic Algorithms , 1995, Springer Vienna.

[18]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[19]  Teuvo Kohonen,et al.  Self-organized formation of topologically correct feature maps , 2004, Biological Cybernetics.

[20]  B. Fritzke,et al.  FLEXMAP-a neural network for the traveling salesman problem with linear time and space complexity , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[21]  Hsin-Chia Fu,et al.  A Hybrid Neural Network Model for Solving Optimization Problems , 1993, IEEE Trans. Computers.

[22]  Richard Durbin,et al.  An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.

[23]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[24]  B. John Oommen,et al.  Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches , 2000, Comput. Oper. Res..

[25]  Bruce L. Golden,et al.  A hierarchical strategy for solving traveling salesman problems using elastic nets , 1995, J. Heuristics.

[26]  Bernard Angéniol,et al.  Self-organizing feature maps and the travelling salesman problem , 1988, Neural Networks.

[27]  Eugene L. Lawler,et al.  A Guided Tour of Combinatorial Optimization , 1985 .

[28]  William J. Wolfe.  A Fuzzy Hopfield-Tank Traveling Salesman Problem Model , 1999, INFORMS J. Comput..

[29]  Tony R. Martinez,et al.  Graded Rescaling in Hopfield Networks , 2001 .

[30]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .

[31]  Jong-Hwan Kim,et al.  An efficient algorithm for traveling salesman problems based on self-organizing feature maps , 1993, [Proceedings 1993] Second IEEE International Conference on Fuzzy Systems.

[32]  Enrique Mérida Casermeiro,et al.  An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem , 2001, Neural Processing Letters.

[33]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[34]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[35]  Jean-Yves Potvin,et al.  THE TRAVELING SALESMAN PROBLEM: A NEURAL NETWORK PERSPECTIVE , 1993 .

[36]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[37]  Laura I. Burke,et al.  The guilty net for the traveling salesman problem , 1992, Comput. Oper. Res..

[38]  B. John Oommen,et al.  The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem , 1999, Neural Networks.

[39]  Chee-Kit Looi,et al.  Neural network methods in combinatorial optimization , 1992, Comput. Oper. Res..

[40]  Takao Enkawa,et al.  A self-organising model for the travelling salesman problem , 1997 .

[41]  Laura I. Burke,et al.  Neural methods for the traveling salesman problem: Insights from operations research , 1994, Neural Networks.

[42]  ATSPDavid S. JohnsonAT.  Experimental Analysis of Heuristics for the Stsp , 2001 .

[43]  Nobuaki Ootake,et al.  The Composition of Chaos Hopfield Neural Network and Gaussian Machine to the Traveling Salesman Problem , 1998, ICONIP.

[44]  Marco Budinich,et al.  A Self-Organizing Neural Network for the Traveling Salesman Problem That Is Competitive with Simulated Annealing , 1996, Neural Computation.

[45]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[46]  James P. Ignizio,et al.  Neural networks and operations research: An overview , 1992, Comput. Oper. Res..

[47]  Richard Szeliski,et al.  An Analysis of the Elastic Net Approach to the Traveling Salesman Problem , 1989, Neural Computation.

[48]  G. J. Hueter.  Solution of the traveling salesman problem with an adaptive ring , 1988, IEEE 1988 International Conference on Neural Networks.

[49]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[50]  James V. Stone.  The Optimal Elastic Net: Finding Solutions to the Travelling Salesman Problem , 1992 .

[51]  F. Favata,et al.  A study of the application of Kohonen-type neural networks to the Travelling Salesman Problem , 1991, Biological Cybernetics.

[52]  William J. Wolfe,et al.  Summary of the neural centroid TSP , 1998, Defense, Security, and Sensing.

[53]  D. J. Burr,et al.  An improved elastic net method for the traveling salesman problem , 1988, IEEE 1988 International Conference on Neural Networks.

[54]  Kate Smith-Miles,et al.  Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research , 1999, INFORMS J. Comput..

[55]  G. Pawley,et al.  On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank , 2004, Biological Cybernetics.

[56]  J. Fort.  Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem , 1988, Biological Cybernetics.

[57]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[58]  M.C.S. Boeres,et al.  A faster elastic-net algorithm for the traveling salesman problem , 1992, [Proceedings 1992] IJCNN International Joint Conference on Neural Networks.

[59]  Erol Gelenbe,et al.  Neural Networks: Advances and Applications II , 1991 .