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

@article{Basu2012TabuSI, title={Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey}, author={Sumanta Basu}, journal={American Journal of Operations Research}, year={2012}, volume={2012}, pages={163-173} }

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… Expand

#### 41 Citations

Study and Analysis of Various Heuristic Algorithms for Solving Travelling Salesman Problem—A Survey

- Computer Science
- 2020

Four heuristic algorithms for solving travelling salesman problem (TSP) are studied: genetic algorithm combined with ant colony optimization, local-opt and remove sharp heuristics, nearest neighbour, simulated annealing and tabu search. Expand

Combinatorial Optimization: Comparison of Heuristic Algorithms in Travelling Salesman Problem

- Mathematics
- 2019

The Travelling Salesman Problem (TSP) is an NP-hard problem with high number of possible solutions. The complexity increases with the factorial of n nodes in each specific problem. Meta-heuristic… Expand

A Review of the Optimization Algorithms on Traveling Salesman Problem

- Mathematics
- 2015

The Traveling Salesman Problem (TSP) is arguably the most prominent problem in combinatorial optimization. The simple way in which the problem is defined in combination with its notorious difficulty… Expand

An Investigation of Hybrid Tabu Search for the Traveling Salesman Problem

- Computer Science
- BIC-TA
- 2015

This paper presents the first statistically sound and comprehensive comparison taking the entire optimization processes of (hybrid) TS, LK, and MNS into consideration based on a large-scale experimental study. Expand

Preprocessing Schemes for Tabu search on Asymmetric Traveling Salesman Problem

- 2013

The objective of this paper is to implement tabu search on moderate sized asymmetric traveling salesman problems (ATSPs). We introduce preprocessing schemes based on the cross entropy and the… Expand

A Review of Traveling Salesman Problem with Time Window Constraint

- 2015

The Traveling Salesman Problem (TSP) is a famous combinatorial problem which is intensively studied in the area of optimization. TSP solution has wide variety of applications but generally is used in… Expand

Hybrid water flow-like algorithm with Tabu search for traveling salesman problem

- Mathematics
- 2016

This paper presents a hybrid Water Flow-like Algorithm with Tabu Search for solving travelling salesman problem (WFA-TS-TSP).WFA has been proven its outstanding performances in solving TSP meanwhile… Expand

Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem

- Mathematics, Computer Science
- INFOR Inf. Syst. Oper. Res.
- 2017

Abstract This paper presents efficient methods of combining preprocessing methods and tabu search metaheuristic for solving large instances of the asymmetric travelling salesman problem (ATSP) with a… Expand

Solving the Traveling Salesman Problem Using Hydrological Cycle Algorithm

- Computer Science
- 2018

The HCA has successfully solved TSPs and obtained the optimal solution for 20 of 24 benchmarked instances, and near-optimal for the rest, illustrating the efficiency of using HCA for solving discrete domain optimization problems. Expand

A Tabu Search algorithm for the Probabilistic Orienteering Problem

- Computer Science
- Comput. Oper. Res.
- 2021

This work solves the Probabilistic Orienteering Problem by embedding a Monte Carlo evaluator into a Tabu Search algorithm, exploiting their interaction in an innovative way. Expand

#### References

SHOWING 1-10 OF 76 REFERENCES

Scatter search for the vehicle routing problem with time windows

- Computer Science
- Eur. J. Oper. Res.
- 2006

This paper uses a scatter search framework to solve the vehicle routing problem with time windows (VRPTW), generating solution quality that is competitive with the current best metaheuristics. Expand

A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows

- Mathematics, Computer Science
- INFORMS J. Comput.
- 1997

A reactive tabu search metaheuristic for the vehicle routing and scheduling problem with time window constraints is developed and achieves solutions that compare favorably with previously reported results. Expand

A tabu scatter search metaheuristic for the arc routing problem

- Engineering
- 2003

We consider a special routing problem which has a variety of practical applications. In a graph-theoretic context it is known as the capacitated Chinese postman problem. Given an undirected network… Expand

A Tabu Search Heuristic for the Vehicle Routing Problem

- Computer Science, Mathematics
- 1991

Numerical tests on a set of benchmark problems indicate that tabu search outperforms the best existing heuristics, and TABUROUTE often produces the bes known solutions. Expand

A tabu search heuristic for periodic and multi-depot vehicle routing problems

- Mathematics
- 1997

We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle… Expand

A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem

- Computer Science
- Eur. J. Oper. Res.
- 2009

A heuristic algorithm based on tabu search is proposed and tested on several benchmark instances and shows that the proposed algorithm produces high quality results within a reasonable computing time. Expand

Tabu Search heuristics for the Vehicle Routing Problem with Time Windows

- Computer Science
- 2002

This paper surveys the research on the Tabu Search heuristics for the Vehicle Routing Problem with Time Windows and describes basic features of each method, and experimental results for Solomon's benchmark test problems are presented and analyzed. Expand

A parallel iterated tabu search heuristic for vehicle routing problems

- Mathematics, Computer Science
- Comput. Oper. Res.
- 2012

This paper introduces a parallel iterated tabu search heuristic for solving four different routing problems: the classical vehicle routing problem (VRP), the periodic VRP, the multi-depot VRP, and… Expand

A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries

- Computer Science
- J. Comb. Optim.
- 2008

A reactive tabu search metaheuristic is designed that can check feasibility of proposed moves quickly and reacts to repetitions to guide the search in the vehicle routing problem with pickups and deliveries. Expand

A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows

- Computer Science
- Transp. Sci.
- 1997

A tabu search heuristic for the vehicle routing problem with soft time windows, where lateness at customer locations is allowed although a penalty is incurred and added to the objective value. Expand