Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem
- 19 February 1996
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 76 (8) , 1188-1191
- https://doi.org/10.1103/physrevlett.76.1188
Abstract
We consider the Euclidean traveling salesman problem for cities randomly distributed in the unit -dimensional hypercube, and investigate the finite size scaling of the mean optimal tour length . With toroidal boundary conditions we find, motivated by a remarkable universality in the th nearest neighbor distribution, that and . We then consider a mean-field approach in the limit which we find to be a good approximation (the error being less than 2.1% at , and 3), and which suggests that at large .
Keywords
This publication has 8 references indexed in Scilit:
- Large-step markov chains for the TSP incorporating local search heuristicsOperations Research Letters, 1992
- An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probabilityOperations Research Letters, 1990
- The Cavity Method and the Travelling-Salesman ProblemEurophysics Letters, 1989
- Statistical Mechanics and the Travelling Salesman ProblemEurophysics Letters, 1986
- Mean-Field Equations for the Matching and the Travelling Salesman ProblemsEurophysics Letters, 1986
- On the statistical mechanics of optimization problems of the travelling salesman typeJournal de Physique Lettres, 1984
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959