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

DOI10.1016/J.EJOR.2014.12.020MaRDI QIDQ319156zbMATH OpenOpenAlexFDO

Authors Bahar Çavdar, Joel 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

tour length estimationTSP

Mathematics Subject Classification ID

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

Recommendations

• On estimating the distribution of optimal traveling salesman tour lengths using heuristics
• Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
• Operational estimators for the length of a traveling salesman tour
• Optimal TSP tour length estimation using Sammon maps
• Optimal TSP tour length estimation using standard deviation as a predictor

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
• scientific article; zbMATH DE number 1076399 (Why is no real title available?)
• scientific article; zbMATH DE number 3193293 (Why is no real title available?)
• Location-routing: issues, models and methods
• Operational estimators for the length of a traveling salesman tour
• Spacefilling curves and the planar travelling salesman problem
• The traveling salesman. Computational solutions for RSP applications
• Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation

Cited in

(17)

• Operational estimators for the length of a traveling salesman tour
• Total distance approximations for routing solutions
• Continuous approximation models in freight distribution management
• The dynamic-demand joint replenishment problem with approximated transportation costs
• Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
• Technical note: the expected length of an orderly path
• A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
• A concise guide to existing and emerging vehicle routing problem variants
• On estimating the distribution of optimal traveling salesman tour lengths using heuristics
• Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
• Optimal TSP tour length estimation using standard deviation as a predictor
• Optimal TSP tour length estimation using Sammon maps
• Using regression models to understand the impact of route-length variability in practical vehicle routing
• Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers
• Continuous approximation formulas for location problems
• Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization
• Policies for multi-trip route planning in time-sensitive environments

Describes a project that uses

Uses Software

• LKH
• TSPLIB
• Concorde

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319156)