Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
From MaRDI portal
Publication:1905084
DOI10.1016/0305-0548(94)00093-NzbMath0838.90127OpenAlexW2022069507MaRDI QIDQ1905084
Edward A. Wasil, Ohseok Kwon, Bruce L. Golden
Publication date: 25 February 1996
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)00093-n
regressionneural network modelsestimators of the optimal tour lengthlength of an optimal traveling salesman tour
Related Items (13)
Total distance approximations for routing solutions ⋮ A distribution-free TSP tour length estimation model for random graphs ⋮ Data-driven optimization and statistical modeling to improve meter reading for utility companies ⋮ 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 ⋮ 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 ⋮ The effects of a new selection operator on the performance of a genetic algorithm ⋮ Dividing a Territory Among Several Vehicles
Cites Work
This page was built for publication: Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
