An improved elastic net method for the traveling salesman problem
- 1 January 1988
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 69-76 vol.1
- https://doi.org/10.1109/icnn.1988.23830
Abstract
An elastic net method is presented for finding traveling-salesman tours; the method improves on the convergence properties of a recent model proposed by R. Durbin and D. Willshaw (1987). It combines the notion of symmetric forces described by the author in an earlier paper (1981) with an annealing schedule derived directly from the input data. The author demonstrates that the method converges about 50 times faster than the Durbin-Willshaw model on patterns of up to 50 cities. It produces either optimum tours or tours within a few percent of optimum. Several search strategies for larger problems are suggested.Keywords
This publication has 9 references indexed in Scilit:
- Self-organizing feature maps and the travelling salesman problemNeural Networks, 1988
- An analogue approach to the travelling salesman problem using an elastic net methodNature, 1987
- “Neural” computation of decisions in optimization problemsBiological Cybernetics, 1985
- A Learning Algorithm for Boltzmann Machines*Cognitive Science, 1985
- Optimization by simulated annealing: Quantitative studiesJournal of Statistical Physics, 1984
- Matching Elastic TemplatesPublished by Springer Nature ,1983
- Neural networks and physical systems with emergent collective computational abilities.Proceedings of the National Academy of Sciences, 1982
- Elastic Matching of Line DrawingsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- A dynamic model for image registrationComputer Graphics and Image Processing, 1981