Random Tours in the Traveling Salesman Problem: Analysis and Application

Authors:
John Basel, III;Thomas R. Willemain
Affiliations:
Department of Decision Sciences & Engineering Systems, Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA;Department of Decision Sciences & Engineering Systems, Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA
Venue:
Computational Optimization and Applications
Year:
2001

Citing 6
Cited 1

Probabilistic and worst case analyses of classical problems of combinatorial optimization in euclidean space

Mathematics of Operations Research
Operational estimators for the length of a traveling salesman tour

Computers and Operations Research
Optimal sequential sampling policy of partitioned random search and its approximation

Journal of Optimization Theory and Applications
Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search

SIAM Journal on Optimization
Stochastic Methods for Practical Global Optimization

Journal of Global Optimization
Efficient Global Optimization of Expensive Black-Box Functions

Journal of Global Optimization

Computing the variance of tour costs over the solution space of the TSP in polynomial time

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

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.