Title :
Traveling salesman heuristics and embedding dimension in the Hopfield model
Author :
Kahng, Andrew B.
Author_Institution :
Dept. of Comput. Sci. & Eng., California Univ., San Diego, CA, USA
Abstract :
The author discusses methods for improving performance of the Hopfield-Tank quadratic minimization approach to the traveling salesman problem (TSP). A wide range of geometric (e.g. convex-hull based) topological and cutting-plane heuristics are investigated. The author also investigated performance for non-Euclidean and nonmetrizable TSPs using a new concept of embedding dimension. Implications concerning the nature of the Hopfield energy surface are discussed. It is concluded that the Hopfield-Tank formulation is not so robust as might be hoped; however, it remains well suited to many important applications.<>
Keywords :
neural nets; optimisation; Hopfield model; Hopfield-Tank quadratic minimization; convex-hull; cutting-plane heuristics; embedding dimension; energy surface; geometric topological heuristics; traveling salesman problem; Neural networks; Optimization methods;
Conference_Titel :
Neural Networks, 1989. IJCNN., International Joint Conference on
Conference_Location :
Washington, DC, USA
DOI :
10.1109/IJCNN.1989.118627
