Random tours in the traveling salesman problem: Analysis and application

DOI10.1023/A:1011263204536zbMath0983.90051OpenAlexW1515122136MaRDI QIDQ5947151

John III Basel, Thomas R. Willemain

Publication date: 7 April 2002

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011263204536

zbMATH Keywords

traveling salesman problemheuristic searchrandom optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

Optimal TSP tour length estimation using standard deviation as a predictor ⋮ Computing the variance of tour costs over the solution space of the TSP in polynomial time ⋮ Using regression models to understand the impact of route-length variability in practical vehicle routing ⋮ An improved model for estimating optimal VRP solution values

Uses Software

• TSPLIB

This page was built for publication: Random tours in the traveling salesman problem: Analysis and application