Some applications of the generalized vehicle routing problem

R. Baldacci, E. Bartolini, G. Laporte*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

68 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)1072-1077
Number of pages6
JournalJournal of the Operational Research Society
Volume61
Issue number7
DOIs
Publication statusPublished - Jul 2010
Externally publishedYes

Keywords

  • Applications
  • Generalized Vehicle Routing Problem
  • Models

Fingerprint

Dive into the research topics of 'Some applications of the generalized vehicle routing problem'. Together they form a unique fingerprint.

Cite this