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|
Gajulapalli, Ravindra S.
|Keywords:||Asymmetric traveling salesman problem|
|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 asymmetric and sparse. We present results from computational experiments with this implementation which validate our claim. � 2012 Operational Research Society of India.|
|Description:||Basu, Sumanta, Operations Management Group, Indian Institute of Management Calcutta Joka, D.H. Road, Kolkata West Bengal PIN-700104, India; Gajulapalli, Ravindra S., HCL Technologies, Bangalore, India; Ghosh, Diptesh, Indian Institute of Management Ahmedabad, Wing 12 G, Vastrapur, Ahmedabad, Gujarat PIN-380015, India|
ISSN/ISBN - 00303887
DOI - 10.1007/s12597-012-0088-z
|Appears in Collections:||Operations Management|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.