Robust solutions for the Inventory-Routing Problem with uncertain travel times
Wouter Lefever  1, 2, 3, *@  , El-Houssaine Aghezzaf  1, 2@  , Khaled Hadj-Hamou  3@  , Bernard Penz  4@  
1 : Ghent University  -  Website
2 : Department of Industrial Systems Engineering and Product Design
3 : Univ. Grenoble Alpes, CNRS, Laboratoire G-SCOP  (G-SCOP)
Institut Polytechnique de Grenoble - Grenoble Institute of Technology
46 Avenue Félix Viallet, 38000 Grenoble -  France
4 : Laboratoire des sciences pour la conception, l'optimisation et la production  (G-SCOP)
Université Joseph Fourier - Grenoble I, Institut National Polytechnique de Grenoble - INPG, CNRS : UMR5272, Institut National Polytechnique de Grenoble (INPG)
* : Corresponding author

We assess an inventory routing problem (IRP) where a supplier distributes a single product to multiple customers under uncertain travel times. The travel times are independent and symmetric random variables that take values in an interval around their nominal value. Based on the concepts of 'The Price Of Robustness' of Bertsimas and Sim, we develop a robust optimization model for the problem that allows to control the degree of conservatism of the solution. We demonstrate how the valid inequalities that exist for the IRP can be adapted for the robust IRP (RIRP). Furthermore, we present a Benders' decomposition-based matheuristic to solve the problem effectively. Experimental results confirm the success of this approach compared to other robust optimization techniques.

Online user: 1 RSS Feed