The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP) in which the vertex set is partitioned into clusters and vehicles must visit exactly one (or at least one) vertex per cluster. The GVRP provides a useful modelling framework for a wide variety of applications. The purpose of this paper is to provide such examples of applications and models. These include the Travelling Salesman with Profits, several VRP extensions, the Windy Routing Problem, and the design of tandem configurations for automated guided vehicles.
Some Applications of the Generalized Vehicle Routing Problem / R. Baldacci; E. Bartolini; G. Laporte. - In: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY. - ISSN 0160-5682. - ELETTRONICO. - 61:(2010), pp. 1072-1077. [10.1057/jors.2009.51]
Some Applications of the Generalized Vehicle Routing Problem
BALDACCI, ROBERTO;
2010
Abstract
The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP) in which the vertex set is partitioned into clusters and vehicles must visit exactly one (or at least one) vertex per cluster. The GVRP provides a useful modelling framework for a wide variety of applications. The purpose of this paper is to provide such examples of applications and models. These include the Travelling Salesman with Profits, several VRP extensions, the Windy Routing Problem, and the design of tandem configurations for automated guided vehicles.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
