Improving a Constructive Heuristic for the General Routing Problem

The seminar is held by Adam Letchford, professor at Lancaster University.

  • Date: 06 SEPTEMBER 2022  from 15:00 to 17:00

  • Event location: Room 5.4 - Department of Electrical, Electronic, and Information Engineering "Guglielmo Marconi" DEI - Viale Risorgimento, 2 - Bologna

  • Type: Seminar


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.