A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing
Year of publication: |
2022
|
---|---|
Authors: | Heßler, Katrin ; Irnich, Stefan |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 50.2022, 2, p. 155-159
|
Subject: | Dynamic programming | Linear time complexity | Maximum gap problem | Picker routing problem | Tourenplanung | Vehicle routing problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung | Algorithmus | Algorithm |
-
Penalty-based algorithms for the stochastic obstacle scene problem
Aksakalli, Vural, (2014)
-
Luo, Yongliang, (2018)
-
Route relaxations on GPU for vehicle routing problems
Boschetti, Marco Antonio, (2017)
- More ...
-
Heßler, Katrin, (2021)
-
Exact solution of the single-picker routing problem with scattered storage
Heßler, Katrin, (2024)
-
Stabilized branch-and-price algorithms for vector packing problems
Heßler, Katrin, (2018)
- More ...