Vehicle routing on road networks:how good is Euclidean approximation?

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

Text (Euclidean-approximation)
Euclidean_approximation.pdf - Accepted Version
Restricted to Repository staff only until 29 June 2022.
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.
Download (4MB)

Official URL: https://doi.org/10.1016/j.cor.2020.105197

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.

Item Type:

Journal Article

Journal or Publication Title:

Computers and Operations Research

Additional Information:

This is the author’s version of a work that was accepted for publication in Computers and Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers and Operations Research, 129, 2021 DOI: 10.1016/j.cor.2020.105197

Uncontrolled Keywords:

/dk/atira/pure/subjectarea/asjc/1700

Subjects:

Departments:

Lancaster University Management School > Management Science

ID Code:

150169

Deposited By:

ep_importer_pure

Deposited On:

04 Jan 2021 16:25

Refereed?: