Inventory Routing Problem over the long term: a math-heuristic approach

Nabil Absi 1 Diego Cattaruzza 2 Dominique Feillet 1 Maxime Ogier 2 Frédéric Semet 2
2 INOCS - Integrated Optimization with Complex Structure
ULB - Université Libre de Bruxelles [Bruxelles], Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : The problem we present is the object of the ROADEF Challenge 2016. It consists in an Inventory Routing Problem over a long time horizon with additional features: the objective function to minimize is fractional (cost per unit delivered); there is no prior assignment of drivers to trailers; the time is accurately modelled: non-constant hourly consumption of each customer is provided while minute-precise delivery planning needs to be determined; vehicles can perform multiple trips during the working day. The problem calls for the determination of a delivery planning that respects operational constraints and avoids customer stockouts.
Document type :
Conference papers
Complete list of metadatas
Contributor : Frédéric Semet <>
Submitted on : Wednesday, June 22, 2016 - 2:22:09 PM
Last modification on : Friday, March 22, 2019 - 1:34:08 AM


  • HAL Id : hal-01335601, version 1


Nabil Absi, Diego Cattaruzza, Dominique Feillet, Maxime Ogier, Frédéric Semet. Inventory Routing Problem over the long term: a math-heuristic approach. Verolog 2016, Jun 2016, Nantes, France. ⟨hal-01335601⟩



Record views