Accepted author manuscript, 364 KB, PDF document
Available under license: CC BY: Creative Commons Attribution 4.0 International License
Final published version
Licence: CC BY: Creative Commons Attribution 4.0 International License
Research output: Contribution to Journal/Magazine › Journal article › peer-review
| <mark>Journal publication date</mark> | 31/01/2023 |
|---|---|
| <mark>Journal</mark> | Networks |
| Issue number | 1 |
| Volume | 81 |
| Number of pages | 14 |
| Pages (from-to) | 93-106 |
| Publication Status | Published |
| Early online date | 25/07/22 |
| <mark>Original language</mark> | English |
The general routing problem (GRP) is a fundamental (Formula presented.) -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.