Home > Research > Publications & Outputs > Improving a constructive heuristic for the gene...

Electronic data

  • GRP-heuristic

    Accepted author manuscript, 364 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

View graph of relations

Improving a constructive heuristic for the general routing problem

Research output: Contribution to Journal/MagazineJournal articlepeer-review

E-pub ahead of print

Standard

Improving a constructive heuristic for the general routing problem. / Boyacı, Burak; Dang, Thu; Letchford, Adam.

In: Networks, 25.07.2022.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Author

Bibtex

@article{0bf7bfa6cf774d4f95c89dda6ae83603,
title = "Improving a constructive heuristic for the general routing problem",
abstract = "The General Routing Problem (GRP) is a fundamental NP-hard vehicle routing problem, first defined by Orloff in 1974. It contains as special cases the Chinese Postman Problem, the Rural Postman Problem, the Graphical TSP and the Steiner TSP. We examine in detail a known constructive heuristic for the GRP, due to Christofides and others. We show how to speed it up, in both theory and practice,while obtaining solutions that are at least as good. Computational results show that, for large instances, our implementation is faster than the original by several orders of magnitude.",
keywords = "vehicle routing, combinatorial optimisation, heuristics",
author = "Burak Boyacı and Thu Dang and Adam Letchford",
year = "2022",
month = jul,
day = "25",
doi = "10.1002/net.22119",
language = "English",
journal = "Networks",
issn = "0028-3045",
publisher = "Blackwell-Wiley",

}

RIS

TY - JOUR

T1 - Improving a constructive heuristic for the general routing problem

AU - Boyacı, Burak

AU - Dang, Thu

AU - Letchford, Adam

PY - 2022/7/25

Y1 - 2022/7/25

N2 - The General Routing Problem (GRP) is a fundamental NP-hard vehicle routing problem, first defined by Orloff in 1974. It contains as special cases the Chinese Postman Problem, the Rural Postman Problem, the Graphical TSP and the Steiner TSP. We examine in detail a known constructive heuristic for the GRP, due to Christofides and others. We show how to speed it up, in both theory and practice,while obtaining solutions that are at least as good. Computational results show that, for large instances, our implementation is faster than the original by several orders of magnitude.

AB - The General Routing Problem (GRP) is a fundamental NP-hard vehicle routing problem, first defined by Orloff in 1974. It contains as special cases the Chinese Postman Problem, the Rural Postman Problem, the Graphical TSP and the Steiner TSP. We examine in detail a known constructive heuristic for the GRP, due to Christofides and others. We show how to speed it up, in both theory and practice,while obtaining solutions that are at least as good. Computational results show that, for large instances, our implementation is faster than the original by several orders of magnitude.

KW - vehicle routing

KW - combinatorial optimisation

KW - heuristics

U2 - 10.1002/net.22119

DO - 10.1002/net.22119

M3 - Journal article

JO - Networks

JF - Networks

SN - 0028-3045

ER -