Abstract
The Travelling Salesman Problem (TSP) has been studied for long times (see e.g. [2]) and, as for all NP-complete problems, all exact solutions take a time that can grow exponentially with the number of cities. Many heuristic algorithms exist for practical instances [3].
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Durbin R. and Willshaw D., Nature 336 1987 pp. 689–691;
Lawler E.L., Lenstra J.K., Rinooy Khan A.G. and Shmoys D.B. (editors), The Traveling Salesman Problem, 1985 J. Wiley New York;
Johnson D., in: Proceedings of the 17 th Colloquium on Automata, Languages and Programming, 1990 Springer-Verlag New York, pp. 446–461;
Von der Malsburg Ch., Kybernetik 14 1973 pp. 85–100;
Kohonen T., Self-Organisation and Associative Memory, 1984 (3rd Ed. 1989) Springer-Verlag Berlin Heidelberg;
Angéniol B., de La Croix Vaubois G. and Le Texier J.-Y., Neural Networks 1 1988 pp. 289–293;
Favata F. and Walker R., Biological Cybernetics 64 1991 pp.463–468;
Kirkpatrick S., Gelatt C.D. Jr and Vecchi M.P., Science 220 13 May 1983 pp. 671–680;
Müller B. and Reinhardt J., Neural Networks, 1990 Springer-Verlag Berlin Heidelberg;
Lin S. and Kernigham B.W., Oper. Res. 21 1973 pp. 498–516;
The first algorithm of this kind was introduced by: Hopfield J.J. and Tank D.W., “Neural” Computation of Decisions in Optimization Problems, Biological Cybernetics 52 (1985) pp. 141–152;
Erwin E., Obermayer K. and Schulten K., Biological Cybernetics 67 (1992) pp. 47–55;
M. Budinich and J. G. Taylor in preparation.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag London Limited
About this paper
Cite this paper
Budinich, M. (1994). A Self-Organising Neural Network for the Travelling Salesman Problem that is Competitive with Simulated Annealing. In: Marinaro, M., Morasso, P.G. (eds) ICANN ’94. ICANN 1994. Springer, London. https://doi.org/10.1007/978-1-4471-2097-1_84
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2097-1_84
Published:
Publisher Name: Springer, London
Print ISBN: 978-3-540-19887-1
Online ISBN: 978-1-4471-2097-1
eBook Packages: Springer Book Archive