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
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - Improving a constructive heuristic for the general routing problem
AU - Boyacı, Burak
AU - Dang, Thu
AU - Letchford, Adam
PY - 2023/1/31
Y1 - 2023/1/31
N2 - 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.
AB - 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.
KW - vehicle routing
KW - combinatorial optimisation
KW - heuristics
U2 - 10.1002/net.22119
DO - 10.1002/net.22119
M3 - Journal article
VL - 81
SP - 93
EP - 106
JO - Networks
JF - Networks
SN - 0028-3045
IS - 1
ER -