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

Authors:
K. Smith
Affiliations:
Dept. of Bus. Syst., Monash Univ., Clayton, Vic.
Venue:
IEEE Transactions on Neural Networks
Year:
1996

Citing 0
Cited 8

An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem

Neural Processing Letters
An Effective Traveling Salesman Problem Solver Based on Self-Organizing Map

ICANN '02 Proceedings of the International Conference on Artificial Neural Networks
A neural-network-based approach to the double traveling salesman problem

Neural Computation
A memetic neural network for the Euclidean traveling salesman problem

Neurocomputing
Review: Measuring instance difficulty for combinatorial optimization problems

Computers and Operations Research
An overall-regional competitive self-organizing map neural network for the Euclidean traveling salesman problem

Neurocomputing
A study of the transiently chaotic neural network for combinatorial optimization

Mathematical and Computer Modelling: An International Journal
Canonical duality theory and algorithm for solving challenging problems in network optimisation

ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

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