Concentric Tabu Search Algorithm for Solving Traveling Salesman Problem

In this research one of the local search algorithms called the Concentric tabu search (CTS) is used to solve the traveling salesman problem (TSP). One of the well known NP-hard problems in combinatorial optimization is the TSP Problem and it is one of the most competently studied problems in the area of combinatorial optimization. Two different implementations of the Concentric tabu search (CTS): ring moves (RM) and all moves (AM) are used and compared with the traditional tabu search. For searching global optimal solutions for given TSP problems, Concentric tabu search was hybridized with Genetic Algorithm. Computational experiments showed that Concentric tabu search gives better performance than the traditional tabu search and also improves the execution of the Genetic Algorithm (GA) for the solutions of TSP problems. Keywords: Concentric Tabu Search, Tabu Search, Genetic Algorithm, Traveling Salesman Problem.