A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing

Nabil Absi (), Diego Cattaruzza (), Dominique Feillet (), Maxime Ogier () and Frédéric Semet ()
Additional contact information
Nabil Absi: Mines Saint-Étienne and LIMOS UMR CNRS 6158, CMP Georges Charpak, F-13541 Gardanne, France;
Diego Cattaruzza: Université Lille, CNRS, Centrale Lille, Inria, UMR 9189 – CRIStAL, Centre de Recherche en Informatique Signal et Automatique de Lille, F-59000 Lille, France
Dominique Feillet: Mines Saint-Étienne and LIMOS UMR CNRS 6158, CMP Georges Charpak, F-13541 Gardanne, France;
Maxime Ogier: Université Lille, CNRS, Centrale Lille, Inria, UMR 9189 – CRIStAL, Centre de Recherche en Informatique Signal et Automatique de Lille, F-59000 Lille, France
Frédéric Semet: Université Lille, CNRS, Centrale Lille, Inria, UMR 9189 – CRIStAL, Centre de Recherche en Informatique Signal et Automatique de Lille, F-59000 Lille, France

Transportation Science, 2020, vol. 54, issue 2, 313-329

Abstract: This paper is part of the special section devoted to the ROADEF/EURO challenge on inventory routing. We propose an extended formulation that we address with a heuristic branch-cut-and-price method. Among the difficulties that we had to face are a fractional objective function, the simultaneous generation of constraints and columns, and a complex pricing problem. We evaluate our approach on the benchmark instances proposed for the challenge.

Keywords: inventory routing problem; branch-cut-and-price method; heuristic; real-life problem (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1287/trsc.2019.0961 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:54:y:2020:i:2:p:313-329

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().