Skip to Main content Skip to Navigation
Conference papers

A heuristic branch-cut-and-price algorithm for the ROADEF/EURO challenge on Inventory Routing

Nabil Absi 1 Diego Cattaruzza 2 Dominique Feillet 1 Maxime Ogier 2 Frédéric Semet 2
2 INOCS - Integrated Optimization with Complex Structure
Inria Lille - Nord Europe, ULB - Université libre de Bruxelles, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : In this paper, we propose a heuristic solution method for the Inventory Routing Problem introduced during the 2016 ROADEF/EURO challenge, that we coin as REC-IRP. Inventory routing has attracted researchers for many years due to both its practical and theoretical interests (Coelho et al.; 2013). The REC-IRP proposed for the challenge is original and complex for several reasons : the logistic ratio optimization objective, the hourly time-granularity for inventory constraints, the driver/trailer allocation management. Clearly, designing an exact solution approach is out of reach for large size instances as those proposed during the challenge. However, we decided to address the REC-IRP with a branch-cut-and-price framework : a cut-and-column generation procedure is developed, along with a heuristic pricing algorithm to generate new columns and a heuristic fixing procedure to generate integer solutions
Document type :
Conference papers
Complete list of metadatas
Contributor : Maxime Ogier <>
Submitted on : Monday, November 6, 2017 - 11:58:43 AM
Last modification on : Friday, December 11, 2020 - 6:44:07 PM


Files produced by the author(s)


  • HAL Id : hal-01629298, version 1


Nabil Absi, Diego Cattaruzza, Dominique Feillet, Maxime Ogier, Frédéric Semet. A heuristic branch-cut-and-price algorithm for the ROADEF/EURO challenge on Inventory Routing. ROADEF 2017 - 18ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2017, Metz, France. pp.1-2. ⟨hal-01629298⟩



Record views


Files downloads