In this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending their routes at a depot. The objective of the IRP is the minimization of the sum of inventory and transportation costs. The formulations include known and new mathematical programming formulations. Valid inequalities are also presented. The formulations are tested on a large set of benchmark instances. One of the most significant conclusions is that the formulations that use vehicle-indexed variables are superior to the more compact, aggregate formulations.
|Number of pages||22|
|Journal||International Transactions in Operational Research|
|Publication status||Published - 1 Jan 2014|
- Branch-and-cut algorithm
- Integer programming
- Routing problems
- Supply chain management