The Traveling Salesman Problem: A Survey

  title={The Traveling Salesman Problem: A Survey},
  author={Mandell Bellmore and George L. Nemhauser},
  journal={Oper. Res.},
A survey and synthesis of research on the traveling salesman problem is given. We begin by defining the problem and presenting several theorems. This is followed by a general classification of the solution techniques and a detailed description of some of the proven methods. Finally a summary of computational results is given. 

Figures and Tables from this paper

The Traveling Salesman Problem and its Implications
The aim of this review is to outline the main exact and approximate approaches to the traveling salesman problem (TSP), the various problems arisen from recent work on this subject, the particular
A continuous variable representation of the traveling salesman problem
It is shown that every solution to the network problem is a hamiltonian circuit.
A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
  • E. P. Kao
  • Computer Science, Business
    Oper. Res.
  • 1978
This paper presents a preference order dynamic program for solving the traveling salesman problem with stochastic travel times, and introduces a branch-and-bound strategy in the solution procedure.
The traveling salesman problem: An update of research
This article presents a review of attacks on the traveling salesman problem for problems defined on weighted and unweighted graphs and includes some aspects of nonexact algorithms with major interest confined to the establishment of worst-case bounds.
Improved lower bounds to the travelling salesman problem
The dual of the Travelling Salesman Problem is studied as a source of lower bounds for the primai problem and a gênerai itérative procedure in the space of the multipliers, i.e. dual variables is designed, which also provides new simple bounds.
A search algorithm for the traveling salesman problem
  • J. Gupta
  • Computer Science
    Comput. Oper. Res.
  • 1978
Some Simple Applications of the Travelling Salesman Problem
This paper reports on typical applications in computer wiring, vehicle routing, clustering and job-shop scheduling that originated from real world problems and thus seem to be of particular interest.
The adjacency relation on the traveling salesman polytope is NP-Complete
This problem of determining whether two traveling salesman tours correspond to non-adjacent vertices of the convex polytope associated with the traveling salesman problem is shown to be NP-Complete for both the symmetric and nonsymmetric traveled salesman problem.


On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
This paper elaborates a method of attack on traveling-salesman problems, proposed by the authors in an earlier paper, in which linear programming is used to reduce the combinatorial magnitude of such
Letter to the Editor---Graphic Solution of the Traveling-Salesman Problem
The traveling-salesman problem consists in selecting from a total number of closed-circuit routes all passing through a number N of given points the one shortest route. To consider all the possible
Letter to the Editor---Selection of an Initial Solution for the Traveling-Salesman Problem
The present writer has developed a procedure that is not iterative and that rapidly selects a single solution. Experience in solving a number of problems by this method discloses a persistent, though
A Method for Solving Traveling-Salesman Problems
A method of solution for the traveling-salesman problem that is applicable to both symmetric and asymmetric problems with random elements, and does not use subjective decisions, so that it can be completely mechanized.
An Engineering Approach to the Traveling Salesman Problem
An engineering approach to the traveling salesman problem is a method which is intuitively “reasonable” to the non-mathematician and has been applied successfully to the 20, 48, and 57 city traveling salesman problems.
On the Relation Between the Traveling-Salesman and the Longest-Path Problems
It is found that the traveling-salesman problem is a special case of the longest-path problem, which is the problem of finding the longest path between two nodes in a finite, connected graph.
A Heuristic Approach to Solving Travelling Salesman Problems
A code for solving travelling salesman problem employing heuristic ideas and numerical experience with the code is described as well as weaknesses and strengths of the method.
Dynamic Programming Treatment of the Travelling Salesman Problem
This problem can be formulated in dynamic programming terms, and resolved computationally for up to 17 cities, and combined with various simple manipulations may be used to obtain quick approximate solutions.
A dynamic programming approach to sequencing problems
A dynamic programming approach to the solution of three sequencing problems: a scheduling problem involving arbitrary cost functions, the traveling-salesman problem, and an assembly line balancing problem that admits of numerical solution through the use of a simple recursion scheme.
Solution of a Large-Scale Traveling-Salesman Problem
The RAND Corporation in the early 1950s contained “what may have been the most remarkable group of mathematicians working on optimization ever assembled” [6]: Arrow, Bellman, Dantzig, Flood, Ford,