On the Stochastic Euclidean Travelling Salesperson Problem for Distributions with Unbounded Support
暂无分享,去创建一个
We study the asymptotic behavior of the shortest tour Tn through n points X1, ', Xn in ℝdd ⥠2, where Xiiâ¥1 are i.i.d. random variables, whose density fx has an unbounded support. Beardwood et al. [2] conjectured that Tn/n1-1/d converges a.s. if and only if â« fx1-1/ddx < ∞ and â« fxâxâd/d-1dx < ∞. We disprove this conjecture, and we show that the second integrability condition is not strong enough. We give a stronger condition that is optimal but not necessary.
[1] J. Michael Steele,et al. Complete Convergence of Short Paths and Karp's Algorithm for the TSP , 1981, Math. Oper. Res..
[2] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.