This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

A review of the Tabu Search Literature on Traveling Salesman Problems

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Sumanta Basu,Diptesh Ghosh

Additional information is available for the following registered author(s):

Abstract

The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition to exactrnmethods. Tabu search is one of the most widely applied metaheuristic for solving the TSP. Inrnthis paper, we review the tabu search literature on the TSP, point out trends in it, and bringrnout some interesting research gaps in this literature.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.iimahd.ernet.in/publications/data/Basu-2008-10-01.pdf
File Format: application/pdf
File Function: English Version
Download Restriction: no

Publisher Info
Paper provided by Indian Institute of Management Ahmedabad, Research and Publication Department in its series IIMA Working Papers with number 2008-10-01.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 21 Oct 2008
Date of revision:
Handle: RePEc:iim:iimawp:2008-10-01

Contact details of provider:
Phone: 91 79 2630 7241
Fax: 91 79 2630 6896
Web page: http://www.iimahd.ernet.in/publications
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: ().

Related research
Keywords:

Other versions of this item:

This paper has been announced in the following NEP Reports: References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
  1. Lau, Hoong Chuin & Sim, Melvyn & Teo, Kwong Meng, 2003. "Vehicle routing problem with time windows and a limited number of vehicles," European Journal of Operational Research, Elsevier, vol. 148(3), pages 559-569, August. [Downloadable!] (restricted)
  2. Nanry, William P. & Wesley Barnes, J., 2000. "Solving the pickup and delivery problem with time windows using reactive tabu search," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 107-121, February. [Downloadable!] (restricted)
  3. Augerat, P. & Belenguer, J. M. & Benavent, E. & Corberan, A. & Naddef, D., 1998. "Separating capacity constraints in the CVRP using tabu search," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 546-557, April. [Downloadable!] (restricted)
  4. Daniels, Richard L. & Rummel, Jeffrey L. & Schantz, Robert, 1998. "A model for warehouse order picking," European Journal of Operational Research, Elsevier, vol. 105(1), pages 1-17, February. [Downloadable!] (restricted)
  5. Homberger, Jorg & Gehring, Hermann, 2005. "A two-phase hybrid metaheuristic for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 162(1), pages 220-238, April. [Downloadable!] (restricted)
  6. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July. [Downloadable!] (restricted)
  7. Gendreau, Michel & Laporte, Gilbert & Semet, Frederic, 1998. "A tabu search heuristic for the undirected selective travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 539-545, April. [Downloadable!] (restricted)
  8. Lin, C.K.Y. & Kwok, R.C.W., 2006. "Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1833-1849, December. [Downloadable!] (restricted)
  9. Amberg, Anita & Domschke, Wolfgang & Vo[ss], Stefan, 2000. "Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees," European Journal of Operational Research, Elsevier, vol. 124(2), pages 360-376, July. [Downloadable!] (restricted)
  10. Ichoua, Soumia & Gendreau, Michel & Potvin, Jean-Yves, 2003. "Vehicle dispatching with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 144(2), pages 379-396, January. [Downloadable!] (restricted)
  11. Tarantilis, C.D. & Kiranoudis, C.T., 2007. "A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector," European Journal of Operational Research, Elsevier, vol. 179(3), pages 806-822, June. [Downloadable!] (restricted)
  12. Tuzun, Dilek & Burke, Laura I., 1999. "A two-phase tabu search approach to the location routing problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 87-99, July. [Downloadable!] (restricted)
  13. Brandao, Jose & Mercer, Alan, 1997. "A tabu search algorithm for the multi-trip vehicle routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 180-191, July. [Downloadable!] (restricted)
  14. Russell, Robert A. & Chiang, Wen-Chyuan, 2006. "Scatter search for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 169(2), pages 606-622, March. [Downloadable!] (restricted)
Full references

Cited by:
(explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)

  1. Sumanta Basu,Ravindra S. Gajulapalli,Diptesh Ghosh, 2008. "Implementing Tabu Search to Exploit Sparsity in ATSP Instances," IIMA Working Papers 2008-10-02, Indian Institute of Management Ahmedabad, Research and Publication Department. [Downloadable!]
Statistics
Access and download statistics

Did you know? There are over 21000 authors registered on RePEc Author Service.

This page was last updated on 2009-11-30.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.