Optimization Online


The Continuous Time Inventory Routing Problem

Felipe Lagos (felipe.lagos***at***gatech.edu)
Natashia Boland (natashia.boland***at***gmail.com)
Martin Savelsbergh (martin.savelsbergh***at***isye.gatech.edu)

Abstract: We consider a continuous time variant of the Inventory Routing Problem in which the maximum quantity that can delivered at 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.

Keywords: inventory routing, continuous time

Category 1: Applications -- OR and Management Sciences (Transportation )

Category 2: Integer Programming

Citation: Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, January 2018

Download: [PDF]

Entry Submitted: 01/29/2018
Entry Accepted: 01/29/2018
Entry Last Modified: 12/09/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society