Comparison of neural networks for solving the travelling salesman problem

B.F.J. Maire, La, V.M. Mladenov

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

7 Citations (Scopus)
1 Downloads (Pure)

Abstract

The TSP deals with finding a shortest path through a number of cities. This seemingly simple problem is hard to solve because of the amount of possible solutions. Which is why methods that give a good suboptimal solution in a reasonable time are generally used. In this paper three methods were compared with respect to quality of solution and ease of finding correct parameters: the Integer Linear Programming method, the Hopfield Neural Network, and the Kohonen Self Organizing Feature Map Neural Network
Original languageEnglish
Title of host publicationProceedings of the 11th Symposium on Neural Network Applications in Electrical Engineering (NEUREL), 20-22 September 2012, Belgrade, Serbia
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages21-24
ISBN (Print)978-1-4673-1569-2
DOIs
Publication statusPublished - 2012

Fingerprint Dive into the research topics of 'Comparison of neural networks for solving the travelling salesman problem'. Together they form a unique fingerprint.

  • Cite this

    Maire, La, B. F. J., & Mladenov, V. M. (2012). Comparison of neural networks for solving the travelling salesman problem. In Proceedings of the 11th Symposium on Neural Network Applications in Electrical Engineering (NEUREL), 20-22 September 2012, Belgrade, Serbia (pp. 21-24). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/NEUREL.2012.6419953