Solving the traveling salesman problem with annealing-based heuristics: a computational study

Recently, several general optimization algorithms based on the demon algorithm from statistical physics have been developed and tested on a few traveling salesman problems with encouraging results. In this paper, we conduct an extensive computational study of 11 annealing-based heuristics for the traveling salesman problem. We code versions of simulated annealing, threshold accepting, record-to-record travel and eight heuristics based on the demon algorithm. We apply each heuristic to 29 traveling salesman problems taken from a well-known online library, compare the results with respect to accuracy and running time and provide insights and suggestions for future work.

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

[2]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[3]  James P. Kelly,et al.  Meta-Heuristics: An Overview , 1996 .

[4]  George C. Runger,et al.  See the forest before the trees: fine-tuned learning and its application to the traveling salesman problem , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[5]  Tom Downs,et al.  Fast optimization by Demon Algorithms , 1998 .

[6]  I. Wood,et al.  Demon algorithms and their application to optimization problems , 1998, 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227).

[7]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[9]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[10]  Mauricio G. C. Resende,et al.  Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.

[11]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[12]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[13]  G. Dueck.  New optimization heuristics , 1993 .

[14]  Bruce L. Golden,et al.  A computational study of smoothing heuristics for the traveling salesman problem , 2000, Eur. J. Oper. Res..

[15]  Shawn Carlson.  Algorithm of the Gods , 1997 .

[16]  Michael Creutz,et al.  Microcanonical Monte Carlo Simulation , 1983 .

[17]  G. Rinaldi,et al.  Chapter 4 The traveling salesman problem , 1995 .