zbMATH — the first resource for mathematics

Some applications of the generalized vehicle routing problem. (English) Zbl 1193.90036
Summary: 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.

90B06 Transportation, logistics and supply chain management
90B10 Deterministic network models in operations research
PDF BibTeX Cite
Full Text: DOI