

Author: Percus A.G. Martin O.C.
Publisher: Springer Publishing Company
ISSN: 0022-4715
Source: Journal of Statistical Physics, Vol.94, Iss.5, 1999-03, pp. : 739-758
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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 optimum 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 k th-nearest neighbor links in optimal tours, and invite a theoretical understanding of this phenomenon.
Related content


Traveling Salesman Problem with Clustering
By Schneider Johannes Bukur Thomas Krause Antje
Journal of Statistical Physics, Vol. 141, Iss. 5, 2010-12 ,pp. :


The Random Link Approximation for the Euclidean Traveling Salesman Problem
Journal de Physique I, Vol. 7, Iss. 1, 1997-01 ,pp. :


Microcanonical Finite-Size Scaling
By Kastner M. Promberger M. Hüller A.
Journal of Statistical Physics, Vol. 99, Iss. 5-6, 2000-06 ,pp. :


ITO-based evolutionary algorithm to solve traveling salesman problem
Journal of Physics: Conference Series , Vol. 490, Iss. 1, 2014-03 ,pp. :


Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem
By Xu Shuhui Wang Yong Huang Aiqin
Algorithms, Vol. 7, Iss. 2, 2014-05 ,pp. :