A Review of the Tabu Search Literature on Traveling Salesman Problems

IIMA Institutional Repository

Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/110

Full metadata record

DC Field	Value	Language
dc.contributor.author	Basu, Sumanta	-
dc.contributor.author	Ghosh, Diptesh	-
dc.date.accessioned	2009-07-28T12:26:17Z	-
dc.date.available	2009-07-28T12:26:17Z	-
dc.date.copyright	2008-10	-
dc.date.issued	2009-07-28T12:26:17Z	-
dc.identifier.uri	http://hdl.handle.net/11718/110	-
dc.description.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.	en
dc.language.iso	en	en
dc.relation.ispartofseries	WP;2008-10-01	-
dc.subject	Tabu search	en
dc.subject	Travelling salesman problems	en
dc.title	A Review of the Tabu Search Literature on Traveling Salesman Problems	en
dc.type	Working Paper	en
Appears in Collections:	Working Papers

Files in This Item:

File	Description	Size	Format
2008-10-01basu.pdf		557.5 kB	Adobe PDF	View/Open