Exact Solution of the Single-Picker Routing Problem with Scattered Storage
Published Online:28 Feb 2024https://doi.org/10.1287/ijoc.2023.0075
- Cited by
- European Journal of Operational Research, Vol. 330, No. 2
- European Journal of Operational Research, Vol. 329, No. 3
- One fits all: a flexible branch-and-cut algorithm for picker routing in scattered storage warehouses14 January 2026 | OR Spectrum, Vol. 57
- European Journal of Operational Research, Vol. 277
- European Journal of Operational Research, Vol. 321, No. 3
- 19 May 2024 | OR Spectrum, Vol. 46, No. 3
Volume 36, Issue 6
November-December 2024
Pages 1359-1756, C2
Article Information
Supplemental Material
Metrics
Information
- Received:March 14, 2023
- Accepted:January 04, 2024
- Published Online:February 28, 2024
Copyright © 2024, INFORMS
Cite as
Katrin Heßler, Stefan Irnich (2024) Exact Solution of the Single-Picker Routing Problem with Scattered Storage. INFORMS Journal on Computing 36(6):1417-1435.
https://doi.org/10.1287/ijoc.2023.0075
Keywords
The authors thank Laura Korbacher for fruitful discussions and Siska Langsdorf for her support in producing the figures of the e-companion.
