The continuous-time inventory-routing problem

Felipe Lagos, Natashia Boland, Martin Savelsbergh

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

We consider a continuous-time variant of the inventory-routing problem in which the maximum quantity that can delivered to a customer depends on the customer's storage capacity and product inventory at the time of the delivery. We investigate critical components of a dynamic discretization discovery algorithm and demonstrate in an extensive computational study that these components are sufficient to produce provably high-quality, often optimal solutions.

Original languageEnglish
Pages (from-to)375-399
Number of pages25
JournalTransportation Science
Volume54
Issue number2
DOIs
StatePublished - 2020
Externally publishedYes

Keywords

  • Inventory routing
  • Mixed integer programming
  • Time-expanded network

Fingerprint

Dive into the research topics of 'The continuous-time inventory-routing problem'. Together they form a unique fingerprint.

Cite this