Vehicle minimization for periodic deliveries

Ann Melissa Campbell, Jill R. Hardin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

36 Scopus citations


We consider the problem of minimizing the number of vehicles required to make strictly periodic, single destination deliveries to a set of customers, under the initial assumption that each delivery requires the use of a vehicle for a full day. This problem is motivated by inventory routing problems in which customers consume goods at a steady rate. We evaluate the complexity of the problem and discuss its general properties, including problem decomposition. We also present an algorithm that we show is optimal for special cases. Finally, we extend these results to a general version of the problem.

Original languageEnglish (US)
Pages (from-to)668-684
Number of pages17
JournalEuropean Journal of Operational Research
Issue number3
StatePublished - Sep 16 2005


  • Complexity theory
  • Packing
  • Periodic
  • Routing
  • Scheduling

ASJC Scopus subject areas

  • General Computer Science
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'Vehicle minimization for periodic deliveries'. Together they form a unique fingerprint.

Cite this