Total distance approximations for routing solutions

DOI10.1016/J.COR.2018.10.008zbMath1458.90557OpenAlexW2896636205MaRDI QIDQ1628118

Y. Aharonov

Publication date: 3 December 2018

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

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

zbMATH Keywords

regressionrouting problemsdistance estimation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (5)

Optimal TSP tour length estimation using standard deviation as a predictor ⋮ Using regression models to understand the impact of route-length variability in practical vehicle routing ⋮ Comparison of four mechanisms for request exchange in collaborative transportation ⋮ Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics ⋮ Solution techniques for the inter-modal pickup and delivery problem in two regions

Cites Work

• Unnamed Item
• A distribution-free TSP tour length estimation model for random graphs
• Looking ahead with the pilot method
• An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
• Operational estimators for the length of a traveling salesman tour
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Continuous approximation models in freight distribution management
• Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Modeling Distribution Problems with Time Windows: Part I
• An Asymptotic, Probabilistic Analysis of a Routing Problem
• Multidepot pickup and delivery problems in multiple regions: a typology and integrated model
• Models to estimate average route lengths in different geographical environments
• Request evaluation strategies for carriers in auction-based collaborations

This page was built for publication: Total distance approximations for routing solutions