A branch-price-and-cut algorithm for the two-echelon vehicle routing problem with time windows
Year of publication: |
2022
|
---|---|
Authors: | Mhamedi, Tayeb ; Andersson, Henrik ; Cherkesly, Marilène ; Desaulniers, Guy |
Published in: |
Transportation science. - Hanover, Md. : INFORMS, ISSN 1526-5447, ZDB-ID 2015901-8. - Vol. 56.2022, 1, p. 245-264
|
Subject: | column generation | dual-optimal inequalities | multi-echelon vehicle routing problem | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Heuristik | Heuristics |
-
Optimal multi-agent pickup and delivery using branch-and-cut-and-price algorithms
Lam, Edward, (2025)
-
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
Gschwind, Timo, (2019)
-
Yin, Yunqiang, (2023)
- More ...
-
Mhamedi, Tayeb, (2024)
-
A new formulation based on customer delivery patterns for a maritime inventory routing problem
Glomvik Rakke, Jørgen, (2015)
-
A new decomposition algorithm for a liquefied natural gas inventory routing problem
Andersson, Henrik, (2016)
- More ...