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.
Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey
Published 2012 in American Journal of Operations Research
ABSTRACT
PUBLICATION RECORD
- Publication year
2012
- Venue
American Journal of Operations Research
- Publication date
2012-06-20
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-73 of 73 references · Page 1 of 1
CITED BY
Showing 1-55 of 55 citing papers · Page 1 of 1