The stochastic traveling salesman problem: Finite size scaling and the cavity prediction
arXiv:cond-mat/9802295 · doi:10.1023/A:1004570713967
Abstract
We study the random link traveling salesman problem, where lengths l_ij between city i and city j are taken to be independent, identically distributed random variables. We discuss a theoretical approach, the cavity method, that has been proposed for finding the optimal tour length over this random ensemble, given the assumption of replica symmetry. Using finite size scaling and a renormalized model, we test the cavity predictions against the results of simulations, and find excellent agreement over a range of distributions. We thus provide numerical evidence that the replica symmetric solution to this problem is the correct one. Finally, we note a surprising result concerning the distribution of kth-nearest neighbor links in optimal tours, and invite a theoretical understanding of this phenomenon.
21 pages, 7 figures; to appear in Journal of Statistical Physics (March 1999); this revision contains final version incorporating some changes
References in corpus (1)
Cited by in corpus (14)
- Optimization by Quantum Annealing: Lessons from hard 3-SAT cases
- Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution
- Deterministic walks in random networks: an application to thesaurus graphs
- Analytical Results for the Statistical Distribution Related to Memoryless Deterministic Tourist Walk: Dimensionality Effect and Mean Field Models
- Escaping from cycles through a glass transition
- The influence of memory in deterministic walks in random media: analytical calculation within a mean field approximation
- Analytical calculation of neighborhood order probabilities for high dimensional Poissonic processes and mean field models
- An efficient algorithm to generate large random uncorrelated Euclidean distances: the random link model
- The statistical mechanics of combinatorial optimization problems with site disorder
- Statistical mechanics methods and phase transitions in optimization problems
- Replica Symmetry and Combinatorial Optimization
- The statistical mechanics of traveling salesman type problems
- Replica Symmetry and Replica Symmetry Breaking for the Traveling Salesperson Problem
- Computational Phase Transitions: Benchmarking Ising Machines and Quantum Optimisers