The random link approximation for the Euclidean traveling salesman problem

The traveling salesman problem (TSP) consists of finding the length of the shortest closed tour visiting N “cities.” We consider the Euclidean TSP where the cities are distributed randomly and independently in a d-dimensional unit hypercube. Working with periodic boundary conditions and inspired by a remarkable universality in the kth nearest neighbor distribution, we find for the average optimum tour length h LEi = �

[1]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2]  Josep Díaz,et al.  Proceedings of the 10th Colloquium on Automata, Languages and Programming , 1983 .

[3]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[4]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

[5]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[6]  David S. Johnson,et al.  Asymptotic experimental analysis for the Held-Karp traveling salesman bound , 1996, SODA '96.

[7]  Mike Mannion,et al.  Complex systems , 1997, Proceedings International Conference and Workshop on Engineering of Computer-Based Systems.