Skip to main content

A Self-Organising Neural Network for the Travelling Salesman Problem that is Competitive with Simulated Annealing

  • Conference paper
  • First Online:
ICANN ’94 (ICANN 1994)

Included in the following conference series:

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].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Durbin R. and Willshaw D., Nature 336 1987 pp. 689–691;

    Article  Google Scholar 

  2. Lawler E.L., Lenstra J.K., Rinooy Khan A.G. and Shmoys D.B. (editors), The Traveling Salesman Problem, 1985 J. Wiley New York;

    MATH  Google Scholar 

  3. Johnson D., in: Proceedings of the 17 th Colloquium on Automata, Languages and Programming, 1990 Springer-Verlag New York, pp. 446–461;

    Book  Google Scholar 

  4. Von der Malsburg Ch., Kybernetik 14 1973 pp. 85–100;

    Article  Google Scholar 

  5. Kohonen T., Self-Organisation and Associative Memory, 1984 (3rd Ed. 1989) Springer-Verlag Berlin Heidelberg;

    MATH  Google Scholar 

  6. Angéniol B., de La Croix Vaubois G. and Le Texier J.-Y., Neural Networks 1 1988 pp. 289–293;

    Article  Google Scholar 

  7. Favata F. and Walker R., Biological Cybernetics 64 1991 pp.463–468;

    Article  Google Scholar 

  8. Kirkpatrick S., Gelatt C.D. Jr and Vecchi M.P., Science 220 13 May 1983 pp. 671–680;

    Article  MathSciNet  Google Scholar 

  9. Müller B. and Reinhardt J., Neural Networks, 1990 Springer-Verlag Berlin Heidelberg;

    Book  Google Scholar 

  10. Lin S. and Kernigham B.W., Oper. Res. 21 1973 pp. 498–516;

    Article  Google Scholar 

  11. 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;

    MathSciNet  MATH  Google Scholar 

  12. Erwin E., Obermayer K. and Schulten K., Biological Cybernetics 67 (1992) pp. 47–55;

    Article  Google Scholar 

  13. M. Budinich and J. G. Taylor in preparation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics