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 : Thursday, October 17, 2019 - 2:46:03 PM

File

IRP_article_170916.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : emse-02163171, version 1

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, In press. ⟨emse-02163171⟩

Share

Metrics

Record views

74

Files downloads

74