Abstract
When trying to find approximate solutions for the Traveling Salesman Problem with heuristic optimization algorithms, small moves called Lin-k-Opts are often used. In our paper, we provide exact formulas for the numbers of possible tours into which a randomly chosen tour can be changed with a Lin-k-Opt. Furthermore, we compare the quality of the results to which the various moves lead.
Similar content being viewed by others
References
Der Handlungsreisende—wie er sein soll und was er zu thun hat, um Aufträge zu erhalten und eines glücklichen Erfolgs in seinen Geschäften gewiß zu sein—von einem alten Commis-Voyageur (1832)
Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem. Wiley, New York (1985)
Reinelt, G.: The Traveling Salesman. Springer, Berlin (1994)
Kirkpatrick, S., Gelatt, C.D. Jr., Vecchi, M.P.: Science 220, 671 (1983)
Dueck, G., Scheuer, T.: J. Comput. Phys. 90, 161 (1990)
Moscato, P., Fontanari, J.F.: Phys. Lett. A 146, 204 (1990)
Dueck, G.: J. Comput. Phys. 104, 86 (1993)
Dueck, G., Scheuer, T., Wallmeier, H.-M.: Spektrum der Wissenschaft 1993(3), 42 (1993)
Dueck, G.: Das Sintflutprinzip—Ein Mathematik-Roman. Springer, Heidelberg (2004)
Penna, T.J.P.: Phys. Rev. E 51, R1–R3 (1995)
Marinari, E., Parisi, G.: Europhys. Lett. 19, 451 (1992)
Kerler, W., Rehberg, P.: Phys. Rev. E 50, 4220 (1994)
Hukushima, K., Nemoto, K.: J. Phys. Soc. Jpn. 65, 1604 (1996)
Hukushima, K., Takayama, H., Yoshino, H.: J. Phys. Soc. Jpn. 67, 12 (1998)
Coluzzi, B., Parisi, G.: J. Phys. A 31, 4349 (1998)
Gu, J., Huang, X.: IEEE Trans. Syst. Man Cybern. 24, 728 (1994)
Schneider, J., Dankesreiter, M., Fettes, W., Morgenstern, I., Schmid, M., Singer, J.M.: Physica A 243, 77 (1997)
Coy, S.P., Golden, B.L., Wasil, E.A.: Eur. J. Oper. Res. 124, 15 (2000)
Schöneburg, E., Heinzmann, F., Feddersen, S.: Genetische Algorithmen und Evolutionsstrategien. Addison-Wesley, Bonn (1994)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Holland, J.: SIAM J. Comput. 2, 88 (1973)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Norwell (1998)
Rego, C., Alidaee, B.: Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search. Kluwer Academic (2005)
Colorni, A., Dorigo, M., Maniezzo, V.: In: Proceedings of ECAL91—European Conference on Artificial Life, Paris, vol. 134 (1991)
Kennedy, J.: In: IEEE International Conference on Evolutionary Computation, Indianapolis, Indiana (1997)
Kennedy, J., Eberhart, R.: In: Proceedings of the 1995 IEEE International Conference on Neural Networks, vol. 4, p. 1942 (1995)
Kennedy, J., Eberhart, R., Shi, Y.: Swarm Intelligence. Morgan Kaufmann, San Mateo (2001)
Stillinger, F.H., Weber, T.A.: J. Stat. Phys. 52, 1429 (1988)
http://www.informatik.uni-heidelberg.de/groups/comopt/software/TSPLIB95
Schneider, J., Froschhammer, C., Morgenstern, I., Husslein, T., Singer, J.M.: Comput. Phys. Comm. 96, 173 (1996)
Schneider, J.: Future Gener. Comput. Syst. 19, 121 (2003)
Lin, S.: Bell Syst. Tech. J. 44, 2245 (1965)
Lin, S., Kernighan, B.W.: Oper. Res. 21, 498 (1973)
Stadler, P.F., Schnabl, W.: Phys. Lett. A 161, 337 (1992)
Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: J. Comput. Phys. 159, 139 (1999)
Kirkpatrick, S., Toulouse, G.: J. Phys. 46, 1277 (1985)
Schneider, J., Morgenstern, I., Singer, J.M.: Phys. Rev. E 58, 5085 (1998)
Schneider, J.J., Kirkpatrick, S.: Stochastic Optimization. Springer, Berlin (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Stattenberger, G., Dankesreiter, M., Baumgartner, F. et al. On the Neighborhood Structure of the Traveling Salesman Problem Generated by Local Search Moves. J Stat Phys 129, 623–648 (2007). https://doi.org/10.1007/s10955-007-9382-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-007-9382-1