A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem

Claudia Archetti (), Luca Bertazzi (), Gilbert Laporte () and Maria Grazia Speranza ()
Additional contact information
Claudia Archetti: Department of Quantitative Methods, University of Brescia, Brescia, Italy
Luca Bertazzi: Department of Quantitative Methods, University of Brescia, Brescia, Italy
Gilbert Laporte: Canada Research Chair in Distribution Management, HEC Montréal and Center for Research on Transportation, Montréal, Canada
Maria Grazia Speranza: Department of Quantitative Methods, University of Brescia, Brescia, Italy

Transportation Science, 2007, vol. 41, issue 3, 382-391

Abstract: We consider a distribution problem in which a product has to be shipped from a supplier to several retailers over a given time horizon. Each retailer defines a maximum inventory level. The supplier monitors the inventory of each retailer and determines its replenishment policy, guaranteeing that no stockout occurs at the retailer (vendor-managed inventory policy). Every time a retailer is visited, the quantity delivered by the supplier is such that the maximum inventory level is reached (deterministic order-up-to level policy). Shipments from the supplier to the retailers are performed by a vehicle of given capacity. The problem is to determine for each discrete time instant the quantity to ship to each retailer and the vehicle route. We present a mixed-integer linear programming model and derive new additional valid inequalities used to strengthen the linear relaxation of the model. We implement a branch-and-cut algorithm to solve the model optimally. We then compare the optimal solution of the problem with the optimal solution of two problems obtained by relaxing in different ways the deterministic order-up-to level policy. Computational results are presented on a set of randomly generated problem instances.

Keywords: supply chain management; vendor-managed inventory (VMI); deterministic order-up-to level; inventory-routing problem; branch and cut (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (103)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1060.0188 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:41:y:2007:i:3:p:382-391

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().