Genetic local search algorithms for the traveling salesman problem

1991 ◽  
pp. 109-116 ◽  
Author(s):  
Nico L. J. Ulder ◽  
Emile H. L. Aarts ◽  
Hans-Jürgen Bandelt ◽  
Peter J. M. van Laarhoven ◽  
Erwin Pesch
Keyword(s):  
Local Search ◽  
Traveling Salesman Problem ◽  
Search Algorithms ◽  
Traveling Salesman ◽  
Local Search Algorithms ◽  
The Traveling Salesman Problem ◽  
Genetic Local Search

Review of Solution Approaches for the Symmetric Traveling Salesman Problem

2014 ◽  
Vol 7 (1) ◽  
pp. 73-87 ◽  
Author(s):  
Georgios K. D. Saharidis
Keyword(s):  
Genetic Algorithms ◽  
Tabu Search ◽  
Local Search ◽  
Traveling Salesman Problem ◽  
Branch And Bound ◽  
Search Algorithms ◽  
Traveling Salesman ◽  
Local Search Algorithms ◽  
Heuristic Solution ◽  
Symmetric Traveling Salesman Problem

In this paper, the main known exact and heuristic solution approaches and algorithms for the symmetric Traveling Salesman Problem (TSP), published after 1992, are surveyed. The paper categorize the most important existing algorithm to 6 main groups: i) Genetic algorithms, ii) Ant colony methods, iii) Neural Methods, iv) Local search algorithms and Tabu search, v) Lagrangian methods and vi) Branch and bound and branch & cut algorithms.

Sign in / Sign up

Export Citation Format

Share Document