Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/110
Title: A Review of the Tabu Search Literature on Traveling Salesman Problems
Authors: Basu, Sumanta
Ghosh, Diptesh
Keywords: Tabu search;Travelling salesman problems
Issue Date: 28-Jul-2009
Series/Report no.: WP;2008-10-01
Abstract: he Traveling Salesman Problem (TSP) is one of the most widely studied problems in ombinatorial 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 his paper, we review the tabu search literature on the TSP, point out trends in it, and bring out some interesting research gaps in this literature.
URI: http://hdl.handle.net/11718/110
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
2008-10-01basu.pdf557.5 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.