An Analysis of Several Heuristics for the Traveling Salesman Problem

  title={An Analysis of Several Heuristics for the Traveling Salesman Problem},
  author={Daniel J. Rosenkrantz and Richard Edwin Stearns and Philip M. Lewis},
  journal={SIAM J. Comput.},
Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the traveling salesman problem are considered. We measure the closeness of a tour by the ratio of the obtained tour length to the minimal tour length. For the nearest neighbor method, we show the ratio is bounded above by a logarithmic function of the number of nodes. We also provide a logarithmic lower bound on the worst case. A class of approximation methods we call insertion methods are studied, and… 

Figures from this paper

A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane

This work presents a quite simple, fast and practical algorithm to find a short cyclic tour that visits a set of points distributed on the plane and shows that the algorithm is a 'probabilistic' constant-ratio approximation algorithm for uniform random distributions.

Solving the Traveling Salesman Problem Using Efficient Randomized Parallel Approximation Algorithms

  • Keqin Li
  • Computer Science
    Parallel Algorithms Appl.
  • 1997
The techniques of approximation, parallelism, and randomization are combined to solve the traveling salesman problem and it is shown that there is an EREW PRAM algorithm A 1 such that A 1(l) ≤ 2 OPT( l) for all TSP instances l.

Traveling Salesman Facility Location Problems

A by-product of this analysis is an O ( n 2 ) algorithm which solves the PTSFLP in a general network given an a priori probabilistic traveling salesman type of tour, thus improving the best-known algorithm by a factor of n.

Probabilistic analysis of some travelling salesman heuristics

  • H. Ong
  • Computer Science, Business
  • 1984
It is shown that the probability that the tour length produced by this heuristic exceeds any fixed percentage of the expected tour length goes to zero when n tends to infinity.

Lower Bounds for Insertion Methods for TSP

  • Y. Azar
  • Computer Science
    Combinatorics, Probability and Computing
  • 1994
It is shown that the random insertion method for the traveling salesman problem (TSP) may produce a tour Ω(log log n/log log log n) times longer than the optimal tour, even in the Euclidean Plane.

approximation results for the Traveling Salesman and related Problems

This paper revisits the famous heuristic called nearest neighbor (NN) for the traveling salesman problem under maximization and minimization goal and proves that NN is a (t + 1)/2t-approximation for Max TSP [a; ta] and a 2/( t + 1)-approximating for Min TSP[a;Ta] under the standard performance ratio.

Reoptimization of minimum and maximum traveling salesman's tours




Computer solutions of the traveling salesman problem

Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization 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.

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is based on a general

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.

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.

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.

The Traveling Salesman Problem: A Survey

A survey and synthesis of research on the traveling salesman problem is given and a general classification of the solution techniques and a detailed description of some of the proven methods are given.

Three Heuristic Rules for Sequencing Jobs to a Single Production Facility

The study consists of examining the performance of the three heuristic rules in terms of the optimal downtime obtained by the branch and bound algorithm and the downtime which results from a random sequencing of jobs through the facility.

Reducibility Among Combinatorial Problems

  • R. Karp
  • Computer Science
    50 Years of Integer Programming
  • 1972
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.

Algorithm 97: Shortest path

The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.