We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chained Lin-Kernighan heuristic for large-scale traveling salesman problems. Computational results are presented for TSPLIB instances ranging in size from 11,849 cities up to 85,900 cities; for each of these instances, solutions within 1% of the optimal value can be found in under 1 CPU minute on a 300 Mhz Pentium II workstation, and solutions within 0.5% of optimal can be found in under 10 CPU minutes. We also demonstrate the scalability of the heuristic, presenting results for randomly generated Euclidean instances having up to 25,000,000 cities. For the largest of these random instances, a tour within 1% of an estimate of the optimal value can b...
The program described in this memorandum has been written in Burroughs Extended Algol (BEA). It is a...
We consider eight heuristics for constructing approximate solutions to the traveling salesman proble...
We present an “adaptive multi-start” genetic algorithm for the Euclidean traveling salesman problem ...
Thesis deals with solving large-scale traveling salesman problem. The aim is to find the best possib...
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman ...
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman ...
The multilevel paradigm has recently been applied to the travelling salesman problem with consid-era...
AbstractTabu search is a general heuristic procedure for global optimization which has been successf...
Abstract — With the arrival of multi-cores, every processor has now built-in parallel computational ...
An n log n randomized method based on POPMUSIC metaheuristic is proposed for generating reasonably g...
The method has been tested on instances with billions of cities. For a lot of problem instances of t...
The Traveling Salesman Problem (TSP) is a very hard optimization problem in the field of operations ...
This paper is the first to present a parallelization of a higly efficient best-first branch-and-boun...
-Helsgaun’s implementation of the Lin-Kernighan algorithm (LKH) is an effective heuristic solver for...
This paper is the first to present a parallelization of a highly efficient best-first branch-and-bou...
The program described in this memorandum has been written in Burroughs Extended Algol (BEA). It is a...
We consider eight heuristics for constructing approximate solutions to the traveling salesman proble...
We present an “adaptive multi-start” genetic algorithm for the Euclidean traveling salesman problem ...
Thesis deals with solving large-scale traveling salesman problem. The aim is to find the best possib...
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman ...
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman ...
The multilevel paradigm has recently been applied to the travelling salesman problem with consid-era...
AbstractTabu search is a general heuristic procedure for global optimization which has been successf...
Abstract — With the arrival of multi-cores, every processor has now built-in parallel computational ...
An n log n randomized method based on POPMUSIC metaheuristic is proposed for generating reasonably g...
The method has been tested on instances with billions of cities. For a lot of problem instances of t...
The Traveling Salesman Problem (TSP) is a very hard optimization problem in the field of operations ...
This paper is the first to present a parallelization of a higly efficient best-first branch-and-boun...
-Helsgaun’s implementation of the Lin-Kernighan algorithm (LKH) is an effective heuristic solver for...
This paper is the first to present a parallelization of a highly efficient best-first branch-and-bou...
The program described in this memorandum has been written in Burroughs Extended Algol (BEA). It is a...
We consider eight heuristics for constructing approximate solutions to the traveling salesman proble...
We present an “adaptive multi-start” genetic algorithm for the Euclidean traveling salesman problem ...