Abstract
In the original traveling salesman problem, the traveling salesman has the task to find the shortest closed tour through a proposed set of nodes, touching each node exactly once and returning to the initial node at the end. For the sake of the tour length to be minimized, nodes close to each other might not be visited one after the other but separated in the tour. However, for some practical applications, it is useful to group nodes to clusters, such that all nodes of a cluster are visited contiguously. Here we present an approach which leads to an automatic clustering with a clustering parameter governing the sizes of the clusters.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Reinelt, G.: The Traveling Salesman. Springer, Berlin (1994)
Lawler, E.L., Lenstra, J.K., Rinnooy-Kan, A.H.G., Shmoys, D.B. (eds.): The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley Interscience Series in Discrete Mathematics. Wiley, New York (1985)
Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2007)
Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and its Variations. Springer, Berlin (2007)
Der Handlungsreisende – wie er seyn soll und was er zu thun hat, um Aufträge zu erhalten und eines glücklichen Erfolgs in seinen Geschäften gewiß zu seyn – von einem alten Commis-Voyageur (1832)
Cook, W., Espinoza, D., Goycoolea, M.: Computing with domino-parity inequalities for the TSP. Preprint (2005)
Bentner, J., Bauer, G., Obermair, G.M., Morgenstern, I., Schneider, J.: Optimization of the time-dependent traveling salesman problem with Monte Carlo methods. Phys. Rev. E 64, 036701 (2001)
Schneider, J.: The time-dependent traveling salesman problem. Physica A 314, 151–155 (2002)
Dumas, Y., Desrosiers, J., Gelinas, E., Solomon, M.M.: An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. 43, 367–371 (1995)
Gendreau, M., Hertz, A., Laporte, G., Stan, M.: A generalized insertion heuristic for the traveling salesman problem with time windows. Oper. Res. 43, 330–335 (1998)
Schneider, J.: Searching for backbones—a high-performance parallel algorithm for solving combinatorial optimization problems. Future Gener. Comput. Syst. 19, 121–131 (2003)
Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results—using the ruin & recreate principle. J. Comput. Phys. 159, 139–171 (2000)
Schneider, J., Britze, J., Ebersbach, A., Morgenstern, I., Puchta, M.: Optimization of production planning problems—a case study for assembly lines. Int. J. Mod. Phys. C 11, 949–972 (2000)
Edmonds, J., Johnson, E.L.: Matching, Euler tours, and the Chinese postman. Math. Program. 5, 88–124 (1973)
Parker, R.G., Rardin, R.L.: On the bottleneck traveling salesman problem. Oper. Res. Lett. 2, 269–272 (1982)
Lipowski, A., Lipowska, D.: Traveling salesman problem with a center. Phys. Rev. E 71, 067701 (2005)
Chisman, J.A.: The clustered traveling salesman problem. Comput. Oper. Res. 2, 115–119 (1975)
Laporte, G., Palekar, U.: Some applications of the clustered travelling salesman problem. J. Oper. Res. Soc. 53, 972–976 (2002)
Kirkpatrick, S., Gelatt, C.D. Jr., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Schneider, J., Kirkpatrick, S.: Stochastic Optimization. Springer, Berlin (2006)
Schneider, J., Froschhammer, Ch., Morgenstern, I., Husslein, Th., Singer, J.M.: Searching for backbones—an efficient parallel algorithm for the traveling salesman problem. Comput. Phys. Commun. 96, 173–188 (1996)
Schneider, J., Morgenstern, I., Singer, J.M.: Bouncing towards the optimum: improving the results of Monte Carlo optimization algorithms. Phys. Rev. E 58, 5085–5095 (1998)
Müller, A., Schneider, J.J., Schömer, E.: Packing a multidisperse system of hard disks in a circular environment. Phys. Rev. E 79, 021102 (2009)
Schneider, J.J., Müller, A., Schömer, E.: Ultrametricity property of energy landscapes of multidisperse packing problems. Phys. Rev. E 79, 031122 (2009)
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087–1092 (1953)
Stadler, P.F., Schnabl, W.: The landscape of the traveling salesman problem. Phys. Lett. A 161, 337–344 (1992)
Stattenberger, G., Dankesreiter, M., Baumgartner, F., Schneider, J.J.: On the neighborhood structure of the traveling salesman problem generated by local search moves. J. Stat. Phys. 129, 623–648 (2007)
Ramsey, F.L., Pierce, D.A., Bowman, V.J.: Triangularization of input-output matrices. Technical Report No. 16, Department of Statistics, Oregon State University (1969)
Ramsey, F.L., Pierce, D.A., Bowman, V.J.: Triangularization of input-output matrices. Proc. Bus. Econ. Stat. Sect. Am. Stat. Assoc. 676 (1969)
Sherrington, D., Kirkpatrick, S.: Solvable model of a spin glass. Phys. Rev. Lett. 35, 1792–1796 (1975)
Parisi, G.: A sequence of approximated solutions to the S-K model for spin glasses. J. Phys. A, Math. Gen. 13, L115–L121 (1980)
Kirkpatrick, S., Toulouse, G.: Configuration space analysis of travelling salesman problems. J. Phys. 46, 1277–1292 (1985)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Schneider, J.J., Bukur, T. & Krause, A. Traveling Salesman Problem with Clustering. J Stat Phys 141, 767–784 (2010). https://doi.org/10.1007/s10955-010-0080-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-010-0080-z