Travelling Salesman Problem with a Center
Statistical Mechanics
2009-11-10 v2 Computational Complexity
Abstract
We study a travelling salesman problem where the path is optimized with a cost function that includes its length as well as a certain measure of its distance from the geometrical center of the graph. Using simulated annealing (SA) we show that such a problem has a transition point that separates two phases differing in the scaling behaviour of and , in efficiency of SA, and in the shape of minimal paths.
Cite
@article{arxiv.cond-mat/0404424,
title = {Travelling Salesman Problem with a Center},
author = {Adam Lipowski and Dorota Lipowska},
journal= {arXiv preprint arXiv:cond-mat/0404424},
year = {2009}
}
Comments
4 pages, minor changes, accepted in Phys.Rev.E