Some applications of the generalized vehicle routing problem

Some applications of the generalized vehicle routing problem

0.00 Avg rating0 Votes
Article ID: iaor20104847
Volume: 61
Issue: 7
Start Page Number: 1072
End Page Number: 1077
Publication Date: Jul 2010
Journal: Journal of the Operational Research Society
Authors: , ,
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.

Reviews

Required fields are marked *. Your email address will not be published.