Skip to Main content Skip to Navigation
Journal articles

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

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-price-and-cut 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal-emse.ccsd.cnrs.fr/emse-02163171
Contributor : Dominique Feillet <>
Submitted on : Monday, June 24, 2019 - 9:32:02 AM
Last modification on : Wednesday, August 5, 2020 - 3:44:45 AM

File

IRP_article_170916.pdf
Files produced by the author(s)

Identifiers

Citation

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. Transportation Science, INFORMS, 2020, 54 (2), pp.299-564. ⟨10.1287/trsc.2019.0961⟩. ⟨emse-02163171⟩

Share

Metrics

Record views

249

Files downloads

305