Article citationsMore>>

P. Augerat, J. M. Belenguer, E. Benavent, A. Corberán and D. Naddef, “Separating Capacity Constraints in the CVRP Using Tabu Search,” European Journal of Operational Research, Vol. 106, No. 2-3, 1998, pp. 546-557. doi:10.1016/S0377-2217(97)00290-7

has been cited by the following article:

• TITLE: Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey

  AUTHORS: Sumanta Basu

  KEYWORDS: Tabu Search; Traveling Salesman Problem; Vehicle Routing Problem

  JOURNAL NAME: American Journal of Operations Research, Vol.2 No.2, June 20, 2012

  ABSTRACT: The Traveling Salesman Problem (TSP) and its allied problems like Vehicle Routing Problem (VRP) are one of the most widely studied problems in combinatorial 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 this paper, we review the tabu search literature on the TSP and its variations, point out trends in it, and bring out some interesting research gaps in this literature.