A transformation for the mixed general routing problem with turn penalties |
| |
Authors: | D Soler E Martínez J C Micó |
| |
Affiliation: | 1.Universidad Politécnica de Valencia,Valencia,Spain |
| |
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: | |
本文献已被 SpringerLink 等数据库收录! |
|