A heuristic branch-cut-and-price algorithm for the ROADEF/EURO challenge on inventory routing
Year of publication: |
2020
|
---|---|
Authors: | Absi, Nabil ; Cattaruzza, Diego ; Feillet, Dominique ; Ogier, Maxime ; Semet, Frédéric |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 54.2020, 2, p. 313-329
|
Subject: | inventory routing problem | branch-cut-and-price method | heuristic | real-life problem | Heuristik | Heuristics | Tourenplanung | Vehicle routing problem | Lagermanagement | Warehouse management | Bestandsmanagement | Inventory management | Lieferkette | Supply chain |
-
Combinatorial heuristics for inventory routing problems
Tang, Ziye, (2022)
-
Cyclic delivery schedules for an inventory routing problem
Ekici, Ali, (2015)
-
Rabbani, Masoud, (2013)
- More ...
-
A Branch-Price-and-Cut algorithm for the Multi-Commodity two-echelon Distribution Problem
Petris, Matteo, (2024)
-
A column generation based heuristic for the generalized vehicle routing problem with time windows
Yuan, Yuan, (2021)
-
Yuan, Yuan, (2021)
- More ...