Academic Journals Database
Disseminating quality controlled scientific knowledge

Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey

ADD TO MY LIST
 
Author(s): Sumanta Basu

Journal: American Journal of Operations Research
ISSN 2160-8830

Volume: 02;
Issue: 02;
Start page: 163;
Date: 2012;
Original page

Keywords: Tabu Search | Traveling Salesman Problem | Vehicle Routing Problem

ABSTRACT
The Traveling Salesman Problem (TSP) and its allied problems like Vehicle Routing Problem (VRP) are one of the most widely studied problems in combinatorial optimization. It has long been known to be NP-hard and hence research on developing algorithms for the TSP has focused on approximate methods in addition to exact methods. Tabu search is one of the most widely applied metaheuristic for solving the TSP. In this paper, we review the tabu search literature on the TSP and its variations, point out trends in it, and bring out some interesting research gaps in this literature.

Tango Jona
Tangokurs Rapperswil-Jona

     Affiliate Program