Please use this identifier to cite or link to this item:
Title: A Fast Tabu Search Implementation for Large Asymmetric Traveling Salesman Problems Defined on Sparse Graphs
Authors: Basu, Sumanta
Gajulapalli, Ravindra S
Ghosh, Diptesh
Keywords: Tabu Search
Traveling Salesman Problem,
Data Structures
Issue Date: 1-Dec-2010
Series/Report no.: WORKING PAPER SERIES;WPS No. 668/ December 2010
Abstract: Real life traveling salesman problem (TSP) instances are often defined on large, sparse, and asymmetric graphs. Tabu search implementations for the TSP that have been reported in the literature almost always deal with small, dense, and symmetric instances. In this paper, we outline a tabu search implementation which can solve TSP instances much faster than conventional implementations if the graph defining the instance is sparse. We present results from computational experiments with this implementation which validate our claim.
Appears in Collections:2010

Files in This Item:
File Description SizeFormat 
wps-668.pdf194.35 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.