Improving a constructive heuristic for the general routing problem

Boyacı, Burak and Dang, Thu and Letchford, Adam (2023) Improving a constructive heuristic for the general routing problem. Networks, 81 (1). pp. 93-106. ISSN 0028-3045

[img]
Text (GRP-heuristic)
GRP_heuristic.pdf - Accepted Version
Available under License Creative Commons Attribution.

Download (372kB)

Abstract

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.

Item Type:
Journal Article
Journal or Publication Title:
Networks
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700/1710
Subjects:
ID Code:
172027
Deposited By:
Deposited On:
20 Jun 2022 15:35
Refereed?:
Yes
Published?:
Published
Last Modified:
28 Jan 2023 01:20