A Decomposition Approach for the Inventory-Routing Problem

By A. Campbell, Martin W. P. Savelsbergh. Transportation Science, 2004

333 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem (2007, background): “…r st consumed by retailer s at time t: constant over time, i.e. r st = r s , t ∈ T , and randomly generated as an integer number in the interval [10] [100]; product quantity r 0t made available at the supplier at time t: s∈M r s ; maximum inventory level U s at retailer s: r s g s , where g s…”
Modeling an Inventory Routing Problem for perishable products with environmental considerations and demand uncertainty (2015, background): “However, execution of the VMI policy in an effective way is not a simple task, since under this policy the vendor has to deal with an integrated problem consisting of its own vehicle routing decisions and inventory decisions of customers (Campbell and Savelsbergh, 2004; Raa and Aghezzaf, 2009).”
Last Mile Distribution in Humanitarian Relief (2008, methodology): “This approach has been used in a number of IRP studies (for example, Campbell and Savelsbergh, 2004; Jaillet et al., 2002) to reflect the long-term effects of short-term decisions.”