We consider a combinatorial optimization problem arising when a set of pick-up and delivery orders must be satisfied within an Automated Storage/Retrieval System. The computational complexity of the problem is still open, but it is conjectured to be $NP$-hard. We point out some of its relevant properties and we describe three exact optimization algorithms to solve it, one based on dynamic programming and the other two on branch-and-bound. We also present a mixed-integer linear programming model to solve the problem by general purpose mathematical programming solvers. Computational results are provided to assess the effectiveness of these methods.
Revised:
Accepted:
Published online:
Keywords: Order picking, Integer linear programming, Dynamic programming, Branch-and-bound
Nicola Bianchessi  1 ; Dario Ostuni  1 ; Giovanni Righini  1
CC-BY 4.0
Nicola Bianchessi; Dario Ostuni; Giovanni Righini. Exact optimization algorithms for an order picking problem. Open Journal of Mathematical Optimization, Volume 7 (2026), article no. 3, 18 p.. doi: 10.5802/ojmo.51
@article{OJMO_2026__7__A3_0,
author = {Nicola Bianchessi and Dario Ostuni and Giovanni Righini},
title = {Exact optimization algorithms for an order picking problem},
journal = {Open Journal of Mathematical Optimization},
eid = {3},
pages = {1--18},
year = {2026},
publisher = {Universit\'e de Montpellier},
volume = {7},
doi = {10.5802/ojmo.51},
language = {en},
url = {https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.51/}
}
TY - JOUR AU - Nicola Bianchessi AU - Dario Ostuni AU - Giovanni Righini TI - Exact optimization algorithms for an order picking problem JO - Open Journal of Mathematical Optimization PY - 2026 SP - 1 EP - 18 VL - 7 PB - Université de Montpellier UR - https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.51/ DO - 10.5802/ojmo.51 LA - en ID - OJMO_2026__7__A3_0 ER -
%0 Journal Article %A Nicola Bianchessi %A Dario Ostuni %A Giovanni Righini %T Exact optimization algorithms for an order picking problem %J Open Journal of Mathematical Optimization %] 3 %D 2026 %P 1-18 %V 7 %I Université de Montpellier %U https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.51/ %R 10.5802/ojmo.51 %G en %F OJMO_2026__7__A3_0
[1] Paths and Matchings in an Automated Warehouse, Advances in Optimization and Decision Science for Society, Services and Enterprises (M. Paolucci et al., eds.) (AIRO Springer Series), Volume 3, Springer, 2019, pp. 151-159 | DOI
[2] A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses, J. Sched., Volume 27 (2024), pp. 393-407 | Zbl | DOI | MR
[3] Warehousing in the e-commerce era: A survey, Eur. J. Oper. Res., Volume 277 (2019) no. 2, pp. 396-411 | Zbl | DOI | MR
[4] A survey on single crane scheduling in automated storage/retrieval systems, Eur. J. Oper. Res., Volume 254 (2016) no. 3, pp. 691-704 | Zbl | DOI | MR
[5] Design and control of warehouse order picking: A literature review, Eur. J. Oper. Res., Volume 182 (2007) no. 2, pp. 481-501 | Zbl | DOI
[6] Research on warehouse operation: A comprehensive review, Eur. J. Oper. Res., Volume 177 (2007) no. 1, pp. 1-21 | Zbl | DOI
[7] A survey of literature on automated storage and retrieval systems, Eur. J. Oper. Res., Volume 194 (2009) no. 2, pp. 343-362 | Zbl | DOI
[8] Models for warehouse management: Classification and examples, Int. J. Prod. Econ., Volume 59 (1999) no. 1, pp. 519-528
Cited by Sources:
