Photo from wikipedia
The general routing problem (GRP) is a fundamental 𝒩𝒫 ‐hard vehicle routing problem, first defined by Orloff in 1974. It contains as special cases the Chinese postman problem, the rural… Click to show full abstract
The general routing problem (GRP) is a fundamental 𝒩𝒫 ‐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.
Journal Title: Networks
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!