Home > Research > Publications & Outputs > Vehicle routing on road networks

Electronic data

  • Euclidean-approximation

    Rights statement: 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

    Accepted author manuscript, 3.88 MB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Vehicle routing on road networks : how good is Euclidean approximation? / Boyacı, Burak; Dang, Thu; Letchford, Adam.

In: Computers and Operations Research, Vol. 129, 105197, 01.05.2021.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Author

Bibtex

@article{dd6585dd37144b4eaeb6ce4bdd89644c,
title = "Vehicle routing on road networks: how good is Euclidean approximation?",
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.",
keywords = "Vehicle Routing, Combinatorial Optimization",
author = "Burak Boyacı and Thu Dang and Adam Letchford",
note = "This is the author{\textquoteright}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",
year = "2021",
month = may,
day = "1",
doi = "10.1016/j.cor.2020.105197",
language = "English",
volume = "129",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",

}

RIS

TY - JOUR

T1 - Vehicle routing on road networks

T2 - how good is Euclidean approximation?

AU - Boyacı, Burak

AU - Dang, Thu

AU - Letchford, Adam

N1 - 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

PY - 2021/5/1

Y1 - 2021/5/1

N2 - 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.

AB - 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.

KW - Vehicle Routing

KW - Combinatorial Optimization

U2 - 10.1016/j.cor.2020.105197

DO - 10.1016/j.cor.2020.105197

M3 - Journal article

VL - 129

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

M1 - 105197

ER -