A heuristic branch-cut-and-price algorithm for the ROADEF/EURO challenge on Inventory Routing - Mines Saint-Étienne Access content directly
Journal Articles Transportation Science Year : 2020

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

Dates and versions

emse-02163171 , version 1 (24-06-2019)

Identifiers

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

Altmetric

Share

Gmail Facebook X LinkedIn More