An Effective Heuristic Algorithm for the Traveling-Salesman Problem

@article{Lin1973AnEH,
  title={An Effective Heuristic Algorithm for the Traveling-Salesman Problem},
  author={S. Lin and Brian W. Kernighan},
  journal={Oper. Res.},
  year={1973},
  volume={21},
  pages={498-516}
}
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 approach to heuristics that is believed to have wide applicability in combinatorial optimization problems. The procedure produces optimum solutions for all problems tested, "classical" problems appearing in the literature, as well as randomly generated test problems, up to 110 cities. Run times grow… 
An efficient heuristic algorithm for the bottleneck traveling salesman problem
This paper describes a new heuristic algorithm for the bottleneck traveling salesman problem (BTSP), which exploits the formulation of BTSP as a traveling salesman problem (TSP). Computational tests
Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
  • R. Russell
  • Mathematics, Computer Science
    Oper. Res.
  • 1977
This note presents a heuristic for determining very good solutions for the symmetric M-tour traveling salesman problem with some side conditions. These side conditions' pertain to load, distance and
An Approach for Solving Traveling Salesman Problem
TLDR
A new approach for solving the traveling salesman problems (TSP) and a solution algorithm for a variant of this problem is introduced based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution.
A New Heuristic Algorithm for the Classical Symmetric Traveling Salesman Problem
TLDR
A new heuristic algorithm is presented for the classical symmetric traveling salesman problem (TSP) to cut a TSP tour into overlapped blocks and then each block is improved separately, which is efficient for solving the TSPs.
Experimental analysis of heuristics for the bottleneck traveling salesman problem
TLDR
This paper develops efficient heuristic algorithms to solve the bottleneck traveling salesman problem (BTSP) and conducted experiments with specially constructed ‘hard’ instances of the BTSP that produced optimal solutions for all but seven problems.
A PARAMETRIC HYBRID METHOD FOR THE TRAVELING SALESMAN PROBLEM
The traveling salesman problem (TSP) is one of the typical NP–Hard problems of combinatorial optimization area. This paper proposes a new hyper heuristic algorithm named Parametric Hybrid Method
Composite Algorithm Based on Clarke - Wright and Local Search for the Traveling Salesman Problem
TLDR
The experimental result shows that the proposed algorithm can solve a large problem instance of Traveling Salesman Problem up to 85.900 points, with competitive results, small variations of computing time for 30 problem instances, and relatively short computing time.
New heuristic algorithm for traveling salesman problem
  • M. Shahab
  • Computer Science
    Journal of Physics: Conference Series
  • 2019
TLDR
The proposed heuristic algorithm can find the best-known distance for 36 different TSPs and the average of all Goodness Value is 99.50%.
A Computational Comparison of Five Heuristic Algorithms for the Euclidean Traveling Salesman Problem
TLDR
The final result of the computational tests is the conclusion that there are simple and easily implemented heuristic procedures that will produce high quality solutions to the TSP in a moderate amount of computer time.
Effective Algorithm of Simulated Annealing for the Symmetric Traveling Salesman Problem
TLDR
An efficient algorithm, based on the simulated annealing (SA), is constructed that provides a good quality solution in very short time and can find a solution both for the small and very large instances of the problem.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 17 REFERENCES
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. The first produces guaranteed optimal solution for problems
A Heuristic Approach to Solving Travelling Salesman Problems
A code for solving travelling salesman problem employing heuristic ideas is described. Acyclic permutations of the cities are constructed by first choosing two cities at random for a permutation of
A Method for Solving Traveling-Salesman Problems
The traveling-salesman problem is a generalized form of the simple problem to find the smallest closed loop that connects a number of points in a plane. Efforts in the past to find an efficient
A dynamic programming approach to sequencing problems
  • M. Held, R. Karp
  • Computer Science, Mathematics
    ACM National Meeting
  • 1961
TLDR
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.
The Traveling-Salesman Problem and Minimum Spanning Trees
TLDR
It is shown that maxπwπ = C* precisely when a certain well-known linear program has an optimal solution in integers.
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,
An efficient heuristic procedure for partitioning graphs
TLDR
A heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems is presented.
The Traveling Salesman Problem: A Survey
TLDR
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 Design of Minimum-Cost Survivable Networks
We consider the problem of designing a network which satisfies a prespecified survivability criterion with minimum cost. The survivability criterion demands that there be at least r_{ij} node
KARP, "Reducibility among Combinatorial Problems," Computer Science Tech. Rpt
  • 1972
...
1
2
...