Some applications of the generalized vehicle routing problem

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.

Keywords:

• Generalized Vehicle Routing Problem
• models
• applications

Acknowledgements

This research was partly supported by the Marco Polo XXIII Project of the University of Bologna and by the Canadian Natural Sciences and Engineering Research Council under grant 39682–05. This support is gratefully acknowledged.