New formulations for the inventory routing problem
Isaac Balster  1@  , Ruslan Sadykov  2@  
1 : Inria Bordeaux - Sud-Ouest
L'Institut National de Recherche en Informatique et e n Automatique (INRIA)
2 : INRIA Bordeaux Sud-Ouest
L'Institut National de Recherche en Informatique et e n Automatique (INRIA)

We propose new route-based formulations for the inventory routing problem. The first formulation is based on the case where all holding costs are equal. We show that this case can be modelled through an exponential family of non-robust inequalities, which we propose. We show how these inequalities can be separated exactly, and efficiently, as well as heuristically. At last, we show how the approach can be extended to the generic and more complex case with heterogeneous holding costs.


Personnes connectées : 1 Vie privée
Chargement...