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 modeling framework for a wide variety of applications. The purpose of this paper is to provide such examples of applications and models. These include the Traveling Salesman with Profits, several VRP extensions, the Windy Routing Problem, and the design of tandem configurations for automated guided vehicles.