Premium
Formulations for an inventory routing problem
Author(s) -
Archetti Claudia,
Bianchessi Nicola,
Irnich Stefan,
Speranza M. Grazia
Publication year - 2014
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12076
Subject(s) - mathematical optimization , benchmark (surveying) , minification , computer science , vehicle routing problem , routing (electronic design automation) , set (abstract data type) , time horizon , operations research , aggregate (composite) , mathematics , computer network , materials science , geodesy , composite material , programming language , geography
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.