A heuristic branch-cut-and-price algorithm for the ROADEF/EURO challenge on Inventory Routing - Archive ouverte HAL Access content directly
Conference Papers Year :

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

(1) , (2) , (1) , (2) , (2)
1
2

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
Fichier principal
Vignette du fichier
ROADEF2017.pdf (214.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01629298 , version 1 (06-11-2017)

Identifiers

  • HAL Id : hal-01629298 , version 1

Cite

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⟩
223 View
153 Download

Share

Gmail Facebook Twitter LinkedIn More