Exact optimization algorithms for an order picking problem

DOI10.5802/OJMO.51MaRDI QIDQ7396481zbMATH OpenFDO

Authors Nicola Bianchessi, Dario Ostuni, Giovanni Righini

Publication date 2026

Published in OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5802/OJMO.51

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses
• A survey of literature on automated storage and retrieval systems
• A survey on single crane scheduling in automated storage/retrieval systems
• Advances in optimization and decision science for society, services and enterprises. ODS, Genoa, Italy, September 4--7, 2019. Proceedings of the international conference on optimization and decision science
• Design and control of warehouse order picking: a literature review
• Research on warehouse operation: a comprehensive review
• Warehousing in the e-commerce era: a survey

This page was built for publication: Exact optimization algorithms for an order picking problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396481)