¹Universidad Politécnica de Valencia, Valencia, Spain

Correspondence: D Soler, Departamento de Matemática Aplicada-IMPA, Universidad Politécnica de Valencia, Camino de Vera s/n, 46022 Valencia, Spain. E-mail: dsoler@mat.upv.es

Received March 2006; Accepted November 2006; Published online 14 February 2007.

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.