6533b81ffe1ef96bd1277dfd

RESEARCH PRODUCT

Formulations for an inventory routing problem

Nicola BianchessiM. Grazia SperanzaStefan IrnichClaudia Archetti

subject

Inventory routing problemMathematical optimizationSupply chain managementRouting problemsComputer scienceStrategy and ManagementAggregate (data warehouse)Branch-and-cut algorithmInteger programmingManagement Science and Operations ResearchComputer Science ApplicationsDiscrete time and continuous timeManagement of Technology and InnovationBenchmark (computing)MinificationBusiness and International ManagementInteger programmingSupply chain management

description

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.

yearjournalcountryeditionlanguage
2014-02-05International Transactions in Operational Research
10.1111/itor.12076https://doi.org/10.1111/itor.12076