Optimal TSP tour length estimation using Sammon maps

The optimal tour length of a non-Euclidean traveling salesman problem (TSP) can be estimated using the locations of vertices and the circuity factor. In this paper, we propose a method to estimate the optimal tour length of a non-Euclidean TSP using Sammon mapping. While providing accuracy comparable to the approach using the circuity factor, this new method has a number of advantages.