Some Examples of Difficult Traveling Salesman Problems

  title={Some Examples of Difficult Traveling Salesman Problems},
  author={Christos H. Papadimitriou and Kenneth Steiglitz},
  journal={Oper. Res.},
We construct instances of the symmetric traveling salesman problem with n = 8k cities that have the following property: There is exactly one optimal tour with cost n, and there are 2k-1k-1! tours that are next-best, have arbitrarily large cost, and cannot be improved by changing fewer than 3k edges. Thus, there are many local optima with arbitrarily high cost. It appears that local search algorithms are ineffective when applied to these problems. Even more catastrophic examples are available in… 

Figures and Tables from this paper

The Traveling Salesman Problem
The TSP is perhaps the best-studied NP-hard combinatorial optimization problem, and there are many techniques which have been applied, and so-called local search algorithms find better solutions for large instances although they do not have a finite performance ratio.
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
This work considers the asymmetric traveling salesman problem for which the triangular inequality is satisfied, and constructs examples to show that the worst-case ratio of length of tour found to minimum length tour is (n) for n city problems.
Exact Solution of Large Asymmetric Traveling Salesman Problems
The results show that the algorithm performs remarkably well for some classes of problems, determining an optimal solution even for problems with large numbers of cities, yet for other classes, even small problems thwart determination of a provably optimal solution.
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
This survey complements an earlier survey from 1985 compiled by Gilmore, Lawler, and Shmoys and focuses on special cases of the traveling salesman problem that have been obtained during the decade 1985--1995.
An effective implementation of the Lin-Kernighan traveling salesman heuristic
On the refinement of bounds of heuristics algorithms of the traveling salesman poblem
A number of heuristics for the traveling salesman problem (TSP) rely on the assumption that the triangle inequality (TI) is satisfied. When TI does not hold, the paper proposes a transformation such
Knowing All Optimal Solutions Does Not Help for TSP Reoptimization
The concept of reoptimization models the following question: Given an instance of an optimization problem together with an optimal solution, does this knowledge help for finding a high-quality
Reusing Optimal TSP Solutions for Locally Modified Input Instances
Given an instance of an optimization problem together with an optimal solution, the scenario in which this instance is modified locally is considered, and an efficient 1.4-approximation algorithm is presented, which enables us to do better than if the authors simply used Christofides’ algorithm for the modified input.


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.
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 Complexity of Local Search for the Traveling Salesman Problem
It is shown that, unless $P = NP$, local search algorithms for the traveling salesman problem having polynomial time complexity per iteration will generate solutions arbitrarily far from the optimal.
P-Complete Approximation Problems
For P-complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows, quadratic assignment, etc., it is shown that the approximation problem is
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.
The complexity of theorem-proving procedures
  • S. Cook
  • Mathematics, Computer Science
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a
Reducibility among combinatorial problems" in complexity of computer computations
In his 1972 paper, Reducibility Among Combinatorial Problems, Richard Karp used Stephen Cooks 1971 theorem that the boolean satisfiability problem is.
KERNIGHAN, "An Effective Heuristic Algorithm for the Traveling Salesman Problem," Opns
  • Res
  • 1973
Worst Case Analysis of an Algorithm for the Traveling Salesman Problem," presented at the Carnegie-Mellon Conference on Algorithms and Complexity
  • 1976
KERNIGHAN, "An Effective Heuristic Algorithm for the Traveling Salesman Problem,
  • Opns. Res
  • 1973