Document Open Access Logo

Counting Locally Optimal Tours in the TSP

Authors Bodo Manthey , Jesse van Rhijn

PDF

File

Thumbnail PDF
PDF
LIPIcs.MFCS.2025.73.pdf
  • Filesize: 0.92 MB
  • 17 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Randomness, geometry and discrete structures
  • Theory of computation → Approximation algorithms analysis
  • Theory of computation → Discrete optimization
Keywords
  • Travelling salesman problem
  • probabilistic analysis
  • local search
  • heuristics
  • 2-opt

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We show that the problem of counting 2-optimal tours in instances of the Travelling Salesperson Problem (TSP) on complete graphs is #P-complete. In addition, we show that the expected number of 2-optimal tours in random instances of the TSP on complete graphs is O(1.2098ⁿ √{n!}). Based on numerical experiments, we conjecture that the true bound is at most O(√{n!}), which is approximately the square root of the total number of tours.

Cite As Get BibTex

Bodo Manthey and Jesse van Rhijn. Counting Locally Optimal Tours in the TSP. In 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 345, pp. 73:1-73:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.MFCS.2025.73

Author Details

Bodo Manthey
  • Faculty of Electrical Engineering, Mathematics, and Computer Science, University of Twente, The Netherlands
Jesse van Rhijn
  • Faculty of Electrical Engineering, Mathematics, and Computer Science, University of Twente, The Netherlands

Funding

  • van Rhijn, Jesse: Supported by NWO grant OCENW.KLEIN.176.

Acknowledgements

We thank Alexander E. Black for helpful discussions that led to the geometric perspective outlined in Section 4.4.

References

  1. Emile Aarts and Jan Korst. Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. John Wiley & Sons, Inc., USA, 1989. Google Scholar
  2. Emile Aarts and Jan Karel Lenstra, editors. Local Search in Combinatorial Optimization. Princeton University Press, 2003. URL: https://doi.org/10.2307/j.ctv346t9c.
  3. I. G. Abrahamson. Orthant Probabilities for the Quadrivariate Normal Distribution. The Annals of Mathematical Statistics, 35(4):1685-1703, December 1964. URL: https://doi.org/10.1214/aoms/1177700391.
  4. Sanjeev Arora and Boaz Barak. Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge, 2009. URL: https://doi.org/10.1017/CBO9780511804090.
  5. Maxime Bôcher. Certain cases in which the vanishing of the Wronskian is a sufficient condition for linear dependence. Transactions of the American Mathematical Society, 2(2):139-149, 1901. URL: https://doi.org/10.2307/1986214.
  6. Ulrich A. Brodowsky and Stefan Hougardy. The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem. In DROPS-IDN/v2/Document/10.4230/LIPIcs.STACS.2021.18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.STACS.2021.18.
  7. E. Rodney Canfield and Brendan D. McKay. The asymptotic volume of the Birkhoff polytope. Online Journal of Analytic Combinatorics, 2009. Google Scholar
  8. Apostolos Chalkis and Vissarion Fisikopoulos. Volesti: Volume Approximation and Sampling for Convex Polytopes in R. The R Journal, 13(2):642-660, 2021. Google Scholar
  9. Barun Chandra, Howard Karloff, and Craig Tovey. New Results on the Old k-opt Algorithm for the Traveling Salesman Problem. SIAM Journal on Computing, 28(6):1998-2029, January 1999. URL: https://doi.org/10.1137/S0097539793251244.
  10. Zongchen Chen, Elchanan Mossel, and Ilias Zadik. Almost-Linear Planted Cliques Elude the Metropolis Process. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings, pages 4504-4539. Society for Industrial and Applied Mathematics, January 2023. URL: https://doi.org/10.1137/1.9781611977554.ch171.
  11. M. C. Cheng. The Orthant Probabilities of Four Gaussian Variates. The Annals of Mathematical Statistics, 40(1):152-161, 1969. URL: https://www.jstor.org/stable/2239206.
  12. F. N. David. A note on the evaluation of the multivariate normal integral. Biometrika, 40(3-4):458-459, December 1953. URL: https://doi.org/10.1093/biomet/40.3-4.458.
  13. M. E. Dyer and A. M. Frieze. On the Complexity of Computing the Volume of a Polyhedron. SIAM Journal on Computing, 17(5):967-974, October 1988. URL: https://doi.org/10.1137/0217060.
  14. Ioannis Z. Emiris and Vissarion Fisikopoulos. Practical Polytope Volume Approximation. ACM Trans. Math. Softw., 44(4):38:1-38:21, June 2018. URL: https://doi.org/10.1145/3194656.
  15. Christian Engels and Bodo Manthey. Average-case approximation ratio of the 2-opt algorithm for the TSP. Operations Research Letters, 37(2):83-84, March 2009. URL: https://doi.org/10.1016/j.orl.2008.12.002.
  16. Matthias Englert, Heiko Röglin, and Berthold Vöcking. Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Algorithmica, 68(1):190-264, January 2014. Corrected version: https://arxiv.org/abs/2302.06889. URL: https://doi.org/10.1007/s00453-013-9801-4.
  17. Matthias Englert, Heiko Röglin, and Berthold Vöcking. Smoothed Analysis of the 2-Opt Algorithm for the General TSP. ACM Transactions on Algorithms, 13(1):10:1-10:15, September 2016. URL: https://doi.org/10.1145/2972953.
  18. Leslie Ann Goldberg, Rob Gysel, and John Lapinskas. Approximately counting locally-optimal structures. Journal of Computer and System Sciences, 82(6):1144-1160, 2016. URL: https://doi.org/10.1016/j.jcss.2016.04.001.
  19. Bruce Hajek. Cooling Schedules for Optimal Annealing. Mathematics of Operations Research, 13(2):311-329, 1988. URL: https://doi.org/10.1287/MOOR.13.2.311.
  20. Stefan Hougardy, Fabian Zaiser, and Xianghui Zhong. The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem. Operations Research Letters, 48(4):401-404, July 2020. URL: https://doi.org/10.1016/j.orl.2020.05.007.
  21. Mark Jerrum. Large Cliques Elude the Metropolis Process. Random Structures & Algorithms, 3(4):347-359, 1992. URL: https://doi.org/10.1002/rsa.3240030402.
  22. David S. Johnson, Christos H. Papadimitriou, and Mihalis Yannakakis. How easy is local search? Journal of Computer and System Sciences, 37(1):79-100, August 1988. URL: https://doi.org/10.1016/0022-0000(88)90046-3.
  23. Richard M. Karp. Reducibility among Combinatorial Problems. In Raymond E. Miller, James W. Thatcher, and Jean D. Bohlinger, editors, Complexity of Computer Computations: Proceedings of a Symposium on the Complexity of Computer Computations, The IBM Research Symposia Series, pages 85-103. Springer US, Boston, MA, 1972. URL: https://doi.org/10.1007/978-1-4684-2001-2_9.
  24. Marvin Künnemann, Bodo Manthey, and Rianne Veenstra. Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise, August 2023. Comment: Combination of an ISAAC 2013 paper by Bodo Manthey and Rianne Veenstra and an ICALP 2015 paper by Marvin Künnemann and Bodo Manthey. The results of the ISAAC 2013 paper have been improved. URL: https://doi.org/10.48550/arXiv.2308.00306.
  25. S. Lin and B. W. Kernighan. An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research, 21(2):498-516, April 1973. URL: https://doi.org/10.1287/opre.21.2.498.
  26. Bodo Manthey and Jesse van Rhijn. Improved Smoothed Analysis of 2-Opt for the Euclidean TSP. In ISAAC 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2023.52.
  27. Bodo Manthey and Rianne Veenstra. Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise. In Leizhen Cai, Siu-Wing Cheng, and Tak-Wah Lam, editors, Algorithms and Computation, Lecture Notes in Computer Science, pages 579-589, Berlin, Heidelberg, 2013. Springer. Full, improved version: https://arxiv.org/abs/2308.00306. URL: https://doi.org/10.1007/978-3-642-45030-3_54.
  28. Andreas Nolte and Rainer Schrader. A Note on the Finite Time Behavior of Simulated Annealing. Mathematics of Operations Research, 25(3):476-484, 2000. URL: https://doi.org/10.1287/MOOR.25.3.476.12211.
  29. Leslie G. Valiant. The Complexity of Enumeration and Reliability Problems. SIAM Journal on Computing, 8(3):410-421, August 1979. URL: https://doi.org/10.1137/0208032.
  30. Qiaochu Yuan. Answer to "Determinant of a matrix involving factorials", November 2022. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact