A Near Optimal Approach for Symmetric Traveling Salesman Problem in Euclidean Space

Wenhong Tian, Chaojie Huang, Xinyang Wang

2017

Abstract

The traveling salesman problem (TSP) is one of the most challenging NP-hard problems. It has widely applications in various disciplines such as physics, biology, computer science and so forth. The best known approximation algorithm for Symmetric TSP (STSP) whose cost matrix satisfies the triangle inequality (called ?STSP) is Christofides algorithm which was proposed in 1976 and is a 3/2 approximation. Since then no proved improvement is made and improving upon this bound is a funda- mental open question in combinatorial optimization. In this paper, for the first time, we propose Trun- cated Generalized Beta distribution (TGB) for the probability distribution of optimal tour lengths in a TSP. We then introduce an iterative TGB approach to obtain quality-proved near optimal approximation, i.e., (1+1/2((a+1)/(a+2))^(K-1))-approximation where K is the number of iterations in TGB and a(>> 1) is the shape parameters of TGB. The result can approach the true optimum as K increases.

References

  1. D. Applegate, W. Cook, A. Rohe, Chained LinKernighan for large traveling salesman problems, INFORMS Journal on Computing; Winter 2003; 15, 1; ABI/INFORM Global pg. 82.
  2. H. C. An, Robert Kleinberg, David B. Shmoys, Improving Christofides Algorithm for the s-t Path TSP, 2012.
  3. M. Blaser, K. Panagiotou and B. V. R. Rao, A Probabilistic Analysis of Christofides' Algorithm, Algorithm Theory-SWAT 2012, Lecture Notes in Computer Science Volume 7357, 2012, pp 225-236.
  4. N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388, Graduate School of Industrial Administration, CMU, 1976.
  5. W. Cook, In Pursuit of the Traveling Salesman, Princeton University Press, 2012.
  6. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, Chapter 1 The Maximum Traveling Salesman Problem, Kluwer Academic Publishers, New York, NY, USA, 2002.
  7. B. L. Golden. Closed-form statistical estimates of optimal solution values to combinatorial problems. In ACM 78: Proceedings of the 1978 annual conference, pages 467-470, New York, NY, USA, 1978. ACM.
  8. G. J. Hahn and S. S. Shpiro, Statistical Models in Engineering, John Wiley & Sons, Inc., New York, 1967.
  9. K. Helsgaun, General k-opt submoves for the LinKernighan TSP heuristic. Mathematical Programming Computation, 2009,doi: 10.1007/s12532-009-0004-6.
  10. D. S. Johnson, L. A. McGeoch, The Traveling Salesman Problem: A Case Study in Local Optimization, Local search in combinatorial optimization 1, 215-310, 1998.
  11. D. S. Johnson, The Traveling Salesman Problem for random points in the unit square: An experimental and statistical study. Technical Report, 2014.
  12. E. Klarreich, Computer Scientists Find New Shortcuts for Infamous Traveling Salesman Problem, SIMONS SCIENCE NEWS, Jan. 29, 2013.
  13. S. Lin, B. W. Kernighan, An effective heuristic algorithm for the traveling-salesman problem. Oper. Res.21, 498-516 (1973).
  14. LKH codes, http://www.akira.ruc.dk/ keld/research/LKH/,last accessed Jan. 15th of 2015.
  15. G. Reinelt. TSPLIB, a traveling salesman problem library. ORSA Journal on Computing, 3(4):376-384, 1991.
  16. S. Reiter and D. B. Rice. Discrete optimizing solution procedures for linear and nonlinear integer programming problems. Management Science, 12(11):829- 850, 1966.
  17. P. J. Sutcliffe, Moments over the Solution Space TSP, PhD Thesis, University of Technology, Sydney, 2009.
  18. V. Vig and U. S. Palekar. On estimating the distribution of optimal traveling salesman tour lengths using heuristics. European Journal of Operational Research, 186(1):111-119, April 2008.
  19. J. Vygen, New approximation algorithms for the TSP, OPTIMA 90 (2012), 1-12.
Download


Paper Citation


in Harvard Style

Tian W., Huang C. and Wang X. (2017). A Near Optimal Approach for Symmetric Traveling Salesman Problem in Euclidean Space . In Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-218-9, pages 281-287. DOI: 10.5220/0006125202810287


in Bibtex Style

@conference{icores17,
author={Wenhong Tian and Chaojie Huang and Xinyang Wang},
title={A Near Optimal Approach for Symmetric Traveling Salesman Problem in Euclidean Space},
booktitle={Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2017},
pages={281-287},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006125202810287},
isbn={978-989-758-218-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A Near Optimal Approach for Symmetric Traveling Salesman Problem in Euclidean Space
SN - 978-989-758-218-9
AU - Tian W.
AU - Huang C.
AU - Wang X.
PY - 2017
SP - 281
EP - 287
DO - 10.5220/0006125202810287