Abstract
Random solutions to the traveling salesman problem (TSP) exhibit statistical regularities across problem instances. These patterns can assist heuristic search for good solutions by providing easy estimates of the length of the optimal tour.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S.R. Agnihothri, “A mean value analysis of the travelling repairman problem, ” IIE Transactions, vol. 20, pp. 223–229, 1988.
E. Balas, “The prize collecting traveling salesman problem, ” Networks, vol. 19, pp. 621–636, 1989.
J. Basel and T.R. Willemain, “Estimating the length of the optimal traveling salesman tour from random tours, ” Department of Decision Sciences and Engineering Systems, Rensselaer Polytechnic Institute, Troy, NY 12180–3590, Technical Report No. 37-99-475, 1999.
K.D. Boese, A.B. Kahng, and S. Muddu, “A new adaptive multi-start technique for combinatorial global optimizations, ” Operations Research Letters, vol. 16, pp. 101–113, 1994.
T.W. Chien, “Operational estimators for the length of a traveling salesman tour, ” Computers and Operations Research, vol. 19, pp. 469–478, 1992.
W.E. Hart, “Sequential stopping rules for random optimization methods with applications to multistart local search, ” SIAM Journal of Optimization, vol. 9, pp. 270–290, 1999.
M. Held and R.M. Karp, “The traveling-salesman problem and minimum spanning trees, ” Operations Research, vol. 18, pp. 1138–1162, 1970.
M. Held and R.M. Karp, “The traveling-salesman problem and minimum spanning trees, Part II, ” Mathematical Programming, vol. 1, pp. 6–25, 1971.
K.L. Hoffman and M. Padberg, “Traveling salesman problem, ” in Encyclopedia of Operations Research and Management Science, S.I. Gass and C.M. Harris (Eds.), Kluwer Academic: Norwell, MA, 1996.
D.R. Jones, M. Schonlau, and W.J. Welch, “Efficient global optimization of expensive black-box functions, ” Journal of Global Optimization, vol. 13, pp. 455–492, 1998.
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley: New York, 1985.
J.Y. Li and R.R. Rhinehart, “Heuristic random optimization, ” Computers and Chemical Engineering, vol. 22, pp. 427–444, 1998.
I.I. Melamed and I.K. Sigal, “A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem, ” Automation and Remote Control, Addison-Wesley: Reading, MA, vol. 58, pp. 1706–1711, 1997.
F. Mosteller and R.E.K. Rourke, Sturdy Statistics: Nonparametrics and Order Statistics, Addison-Wesley, 1973, p. 257.
G. Reinelt, “TSPLIB–A traveling salesman problem library, ” ORSA Journal on Computing, vol. 3, pp. 376–384, 1991.
J.M. Steele, “Probabilistic and worst case analysis of classical problems of combinatorial optimization in Euclidean space, ” Mathematics of Operations Research, vol. 15, pp. 749–770, 1990.
J.M. Steele, “Probability and problems in Euclidean combinatorial optimization, ” Statistical Science, vol. 8, pp. 48–56, 1993.
Z.B. Tang, “Optimal sequential sampling policy of partitioned random search and its applications, ” Journal of Optimization Theory and Applications, vol. 2, pp. 431–448, 1998.
C.L. Valenzuela and A.J. Jones, “Estimating the Held-Karp lower bound for the geometric TSP, ” European Journal of Operational Research, vol. 102, pp. 157–175, 1997.
Z.B. Zabinsky, “Stochastic methods for practical global optimization, ” Journal of Global Optimization, vol. 13, pp. 433–444, 1998.
Rights and permissions
About this article
Cite this article
Basel, J., Willemain, T.R. Random Tours in the Traveling Salesman Problem: Analysis and Application. Computational Optimization and Applications 20, 211–217 (2001). https://doi.org/10.1023/A:1011263204536
Issue Date:
DOI: https://doi.org/10.1023/A:1011263204536