Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood

Computing ◽  
1995 ◽  
Vol 54 (3) ◽  
pp. 191-211 ◽  
Author(s):  
R. E. Burkard ◽  
V. G. Deineko
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Polynomially Solvable ◽  
Exponential Neighborhood ◽  
The Traveling Salesman Problem

GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY

2001 ◽  
Vol 03 (02n03) ◽  
pp. 213-235 ◽  
Author(s):  
SANTOSH N. KABADI
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Major Portion ◽  
Polynomially Solvable ◽  
The Traveling Salesman Problem ◽  
Special Case

One of the first and perhaps the most well-known polynomially solvable special case of the traveling salesman problem (TSP) is the Gilmore-Gomory case (G-G TSP). Gilmore and Gomory presented an interesting patching algorithm for this case with a fairly non-trivial proof of its validity. Their work has motivated a great deal of research in the area leading to various generalisations of their results and thereby identification of fairly large polynomially solvable subclasses of the TSP. These results form a major portion of the literature on solvable cases of the TSP. In this paper, we survey the main results on solvable cases of the TSP which are direct generalisations of the G-G TSP and/or the Gilmore-Gomory patching scheme.

Small and large TSP: Two polynomially solvable cases of the traveling salesman problem

1993 ◽  
Vol 69 (1) ◽  
pp. 107-120 ◽  
Author(s):  
René van Dal ◽  
Jack A.A. van der Veen ◽  
Gerard Sierksma
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Polynomially Solvable ◽  
The Traveling Salesman Problem

Analysis of the Traveling Salesman Problem with Flexible Colors

2010 ◽  
Author(s):  
Thomas Roemer ◽  
Reza Ahmadi ◽  
Sriram Dasu
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem

A New Heuristic Procedure To Solve The Traveling Salesman Problem

2007 ◽  
Vol 5 (1) ◽  
pp. 1-9
Author(s):  
Paulo Henrique Siqueira ◽  
Sérgio Scheer ◽  
Maria Teresinha Arns Steiner
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Heuristic Procedure ◽  
The Traveling Salesman Problem

scholarly journals An Improved Whale Optimization Algorithm for the Traveling Salesman Problem

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 48
Author(s):  
Jin Zhang ◽  
Li Hong ◽  
Qing Liu
Keyword(s):  
Traveling Salesman Problem ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Relevant Literature ◽  
Population Diversity ◽  
Traveling Salesman ◽  
Whale Optimization Algorithm ◽  
Neighborhood Search ◽  
Whale Optimization ◽  
The Traveling Salesman Problem

The whale optimization algorithm is a new type of swarm intelligence bionic optimization algorithm, which has achieved good optimization results in solving continuous optimization problems. However, it has less application in discrete optimization problems. A variable neighborhood discrete whale optimization algorithm for the traveling salesman problem (TSP) is studied in this paper. The discrete code is designed first, and then the adaptive weight, Gaussian disturbance, and variable neighborhood search strategy are introduced, so that the population diversity and the global search ability of the algorithm are improved. The proposed algorithm is tested by 12 classic problems of the Traveling Salesman Problem Library (TSPLIB). Experiment results show that the proposed algorithm has better optimization performance and higher efficiency compared with other popular algorithms and relevant literature.

scholarly journals An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

1995 ◽  
Vol 43 (2) ◽  
pp. 367-371 ◽  
Author(s):  
Yvan Dumas ◽  
Jacques Desrosiers ◽  
Eric Gelinas ◽  
Marius M. Solomon
Keyword(s):  
Traveling Salesman Problem ◽  
Optimal Algorithm ◽  
Time Windows ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem
Sign in / Sign up

Export Citation Format

Share Document