An argument for abandoning the travelling salesman problem as a neural-network benchmark

In this paper, a distinction is drawn between research which assesses the suitability of the Hopfield network for solving the travelling salesman problem (TSP) and research which attempts to determine the effectiveness of the Hopfield network as an optimization technique. It is argued that the TSP i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on neural networks Jg. 7; H. 6; S. 1542 - 1544
1. Verfasser: Smith, K.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.11.1996
Institute of Electrical and Electronics Engineers
Schlagworte:
Applied sciences
Artificial intelligence
Australia
Computer networks
Computer science; control theory; systems
Connectionism. Neural networks
Exact sciences and technology
Hopfield neural networks
Integer linear programming
Neural networks
Operations research
Testing
Traveling salesman problems
Travelling salesman problem
Neural network
Hopfield model
Optimization
ISSN:1045-9227
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, a distinction is drawn between research which assesses the suitability of the Hopfield network for solving the travelling salesman problem (TSP) and research which attempts to determine the effectiveness of the Hopfield network as an optimization technique. It is argued that the TSP is generally misused as a benchmark for the latter goal, with the existence of an alternative linear formulation giving rise to unreasonable comparisons.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1045-9227
DOI:10.1109/72.548187