Abstract

This paper surveys the “neurally” inspired problem-solving approaches to the traveling salesman problem, namely, the Hopfield-Tank network, the elastic net, and the self-organizing map. The latest achievements in the neural network domain are reported and numerical comparisons are provided with the classical solution approaches of operations research. An extensive bibliography with more than one hundred references is also included. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.

Keywords

Travelling salesman problemPerspective (graphical)Domain (mathematical analysis)Computer scienceArtificial neural networkState (computer science)Operations researchArtificial intelligenceMathematical optimizationMathematicsAlgorithm

Affiliated Institutions

Related Publications

On Finding Primal- and Dual-Optimal Bases

We show that if there exists a strongly polynomial time algorithm that finds a basis which is optimal for both the primal and the dual problems, given an optimal solution for on...

1991 INFORMS Journal on Computing 101 citations

Publication Info

Year
1993
Type
article
Volume
5
Issue
4
Pages
328-348
Citations
98
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

98
OpenAlex

Cite This

Jean‐Yves Potvin (1993). State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective. INFORMS Journal on Computing , 5 (4) , 328-348. https://doi.org/10.1287/ijoc.5.4.328

Identifiers

DOI
10.1287/ijoc.5.4.328