The period vehicle routing problem and its extensions

Peter M. Francis, Karen R. Smilowitz, Michal Tzur

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


This chapter presents an overview of the Period Vehicle Routing Problem, a generalization of the classic vehicle routing problem in which driver routes are constructed over a period of time. We survey the evolution of the PVRP and present a synopsis of modeling and solution methods, including classical heuristics, metaheuristics, and mathematical programming based methods. We review three important variants of the problem: the PVRP with Time Windows, the Multi-Depot PVRP, and the PVRP with Service Choice. We present case studies and highlight related implementation issues, including metrics that quantify the operational complexity of implementing periodic delivery routes. Finally, we discuss potential directions for future work in the area.

Original languageEnglish
Title of host publicationThe Vehicle Routing Problem: Latest Advances and New Challenges
EditorsBruce Golden, S. Raghavan, Edward A. Wasil
Place of PublicationSpringer, Boston, MA.
PublisherSpringer US : Boston, MA
Number of pages30
ISBN (Electronic)978-0-387-77778-8
ISBN (Print)978-0-387-77777-1
StatePublished - 2008

Publication series

NameOperations Research/ Computer Science Interfaces Series
PublisherSpringer Science + Business Media
ISSN (Print)1387-666X


  • Periodic distribution problems
  • Vehicle routing


Dive into the research topics of 'The period vehicle routing problem and its extensions'. Together they form a unique fingerprint.

Cite this