ITERATED TABU SEARCH FOR THE TRAVELING SALESMAN PROBLEM: NEW RESULTS

In this paper, we present some new results obtained for the traveling salesman problem (TSP) by using the iterated tabu search (ITS) meta-heuristic. ITS is a promising extension to the ordinary tabu search scheme. It seeks near-optimal solutions by combining intensification (standard tabu search) and diversification (perturbation of solutions) in a proper way. For the TSP, the main effect is achieved due to decomposition of the solution neighbourhood structure and considerably speeding-up the tabu search process, which is used, namely, in the role of intensification. This fast-iterated tabu search (FITS) technique resulted in quite encouraging solutions for the TSP instances from the TSP instance library TSPLIB. FITS obviously outperformed the other heuristic algorithms used in the experimentation, especially, on the smaller TSP instances.

[1]  Christian Steczkó Nilsson,et al.  Heuristics for the Traveling Salesman Problem , 2003 .

[2]  Jon Louis Bentley,et al.  Experiments on traveling salesman heuristics , 1990, SODA '90.

[3]  Michel Gendreau,et al.  An Introduction to Tabu Search , 2003, Handbook of Metaheuristics.

[4]  David S. Johnson,et al.  Local Optimization and the Traveling Salesman Problem , 1990, ICALP.

[5]  Alfonsas Misevicius,et al.  A Tabu Search Algorithm for the Quadratic Assignment Problem , 2005, Comput. Optim. Appl..

[6]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[7]  David S. Johnson,et al.  8. The traveling salesman problem: a case study , 2003 .

[8]  Giovanni Manzini,et al.  Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP , 1996, INFORMS J. Comput..

[9]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[10]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[11]  Claude-Nicolas Fiechter,et al.  A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..

[12]  Alfonsas Misevičius,et al.  USING ITERATED TABU SEARCH FOR THE TRAVELING SALESMAN PROBLEM , 2015 .

[13]  John Knox,et al.  Tabu search performance on the symmetric traveling salesman problem , 1994, Comput. Oper. Res..

[14]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[15]  F. Glover.  Tabu Search Fundamentals and Uses , 1995 .

[16]  Daniel J. Rosenkrantz,et al.  An analysis of several heuristics for the traveling salesman problem , 2013, Fundamental Problems in Computing.

[17]  G. Dueck,et al.  Record Breaking Optimization Results Using the Ruin and Recreate Principle , 2000 .

[18]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[21]  Edward P. K. Tsang,et al.  Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..

[22]  Richard Durbin,et al.  An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.

[23]  Kenneth D. Boese,et al.  Cost Versus Distance In the Traveling Salesman Problem , 1995 .

[24]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[25]  Bruce L. Golden,et al.  Solving the traveling salesman problem with annealing-based heuristics: a computational study , 2002, IEEE Trans. Syst. Man Cybern. Part A.

[26]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[27]  E. Baum.  Towards practical `neural' computation for combinatorial optimization problems , 1987 .