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
<mark>Journal publication date</mark>25/07/2022
<mark>Journal</mark>Networks
Publication StatusE-pub ahead of print
Early online date25/07/22
<mark>Original language</mark>English

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.