Optimal TSP tour length estimation using standard deviation as a predictor

DOI10.1016/J.COR.2022.105993OpenAlexW4293793743MaRDI QIDQ2676394

Stefan Poikonen, Shuhan Kou, Bruce L. Golden

Publication date: 27 September 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105993

zbMATH Keywords

predictiontraveling salesman problemestimator

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

An improved model for estimating optimal VRP solution values ⋮ Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization

Uses Software

• LKH
• SciPy
• Scikit
• Python
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A distribution-free TSP tour length estimation model for random graphs
• New perspectives in stochastic geometry. Abstracts from the workshop held October 19th -- October 25th, 2008.
• Operational estimators for the length of a traveling salesman tour
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Total distance approximations for routing solutions
• Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
• Computing the variance of tour costs over the solution space of the TSP in polynomial time
• Hard to solve instances of the Euclidean traveling salesman problem
• TSPLIB—A Traveling Salesman Problem Library
• Random tours in the traveling salesman problem: Analysis and application

This page was built for publication: Optimal TSP tour length estimation using standard deviation as a predictor