A distribution-free TSP tour length estimation model for random graphs

DOI10.1016/j.ejor.2014.12.020zbMath1346.90695OpenAlexW2053933584MaRDI QIDQ319156

Bahar Çavdar, Joel S. Sokol

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.020

zbMATH Keywords

TSPtour length estimation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial optimization (90C27)

Related Items (10)

Total distance approximations for routing solutions ⋮ A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution ⋮ Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Optimal TSP tour length estimation using standard deviation as a predictor ⋮ Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers ⋮ Continuous approximation models in freight distribution management ⋮ Using regression models to understand the impact of route-length variability in practical vehicle routing ⋮ Continuous approximation formulas for location problems ⋮ The dynamic-demand joint replenishment problem with approximated transportation costs

Uses Software

• TSPLIB
• LKH
• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Location-routing: issues, models and methods
• Operational estimators for the length of a traveling salesman tour
• The traveling salesman. Computational solutions for RSP applications
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
• Spacefilling curves and the planar travelling salesman problem
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A distribution-free TSP tour length estimation model for random graphs