Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances

The inventory routing problem (IRP) involves the distribution of one or more products from a supplier to a set of customers over a discrete planning horizon. The version treated here, the so‐called vendor managed IRP (VMIRP), is the IRP arising when the replenishment policy is decided a priori. We c...

Full description

Saved in:
Bibliographic Details
Published in:Networks 2015-03, Vol.65 (2), p.129-138
Main Authors: Avella, Pasquale, Boccia, Maurizio, Wolsey, Laurence A.
Format: Article
Language:English
Subjects:
Computer networks
Customers
cutting planes
Demand
inventory routing
Networks
Policies
Raw materials
Replenishment
Routing (telecommunications)
single-item lot sizing
Substructures
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The inventory routing problem (IRP) involves the distribution of one or more products from a supplier to a set of customers over a discrete planning horizon. The version treated here, the so‐called vendor managed IRP (VMIRP), is the IRP arising when the replenishment policy is decided a priori. We consider two replenishment policies. The first is known as order‐up (OU): if a client is visited in a period, then the amount shipped to the client must bring the stock level up to the upper bound. The latter is called maximum level (ML): the maximum stock level in each period cannot be exceeded. The objective is to find replenishment decisions minimizing the sum of the storage and distribution costs. VMIRP contains two important subproblems: a lot‐sizing problem for each customer and a classical vehicle routing problem for each time period. In this paper we present a priori reformulations of VMIRP‐OU and VMIRP‐ML derived from the single‐item lot‐sizing substructure. These reformulations take into account the special nature of the test instances—constant demand for each client over time and stock/production upper bounds that are fixed small multiples of the client's demand. In addition we introduce two new cutting plane families—the cut inequalities—deriving from the interaction between the lot‐sizing and the routing substructures. A branch‐and‐cut algorithm has been implemented to demonstrate the effectiveness of the single‐item reformulations. Computational results on benchmark instances with 50 customers and six periods with a single product and a single vehicle are presented. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 65(2), 129–138 2015
ISSN:0028-3045
1097-0037
DOI:10.1002/net.21586