Boyacı, Burak and Dang, Thu and Letchford, Adam (2021) Vehicle routing on road networks:how good is Euclidean approximation? Computers and Operations Research, 129. ISSN 0305-0548
Euclidean_approximation.pdf - Accepted Version
Restricted to Repository staff only until 29 June 2022.
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.
Download (4MB)
Abstract
Suppose that one is given a Vehicle Routing Problem (VRP) on a road network, but does not have access to detailed information about that network. One could obtain a heuristic solution by solving a modified version of the problem, in which true road distances are replaced with planar Euclidean distances. We test this heuristic, on two different types of VRP, using real road network data for twelve cities across the world. We also give guidelines on the kind of VRP for which this heuristic can be expected to give good results.