Comparison of neural networks for solving the travelling salesman problem

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2012 11th Symposium on Neural Network Applications in Electrical Engineering S. 21 - 24
Hauptverfasser: La Maire, B. F. J., Mladenov, V. M.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.09.2012
Schlagworte:
Biological neural networks
Cities and towns
Hopfield Neural Network
Integer Programming
Kohonen Self Organizing Feature Map Neural Network
Linear programming
Neurons
Organizing
Traveling Salesman Problem
Traveling salesman problems
ISBN:9781467315692, 1467315699
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISBN:9781467315692
1467315699
DOI:10.1109/NEUREL.2012.6419953