| Article ID: | iaor20091076 |
| Country: | United Kingdom |
| Volume: | 59 |
| Issue: | 4 |
| Start Page Number: | 540 |
| End Page Number: | 547 |
| Publication Date: | Apr 2008 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Soler D., Martnez E., Mic J.C. |
| Keywords: | programming: travelling salesman |
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.