A transformation for the mixed general routing problem with turn penalties

Abstract

In this paper, we study a generalization of the Mixed General Routing Problem (MGRP) with turn penalties and forbidden turns. Thus, we present a unified model of this kind of extended versions for both node- and arc-routing problems with a single vehicle. We provide a polynomial transformation of this generalization into an asymmetric travelling salesman problem, which can be considered a particular case of the MGRP. We show computational results on the exact resolution on a set of 128 instances of the new problem using a recently developed code for the MGRP.

Keywords:

• arc routing
• mixed general routing problem
• generalized travelling salesman problem
• transformation

Acknowledgements

We are grateful to JM Sanchis for his help in the computational experiments.