A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing

DOI10.1016/j.orl.2022.01.014OpenAlexW4210624354MaRDI QIDQ2670493

Stefan Irnich, Katrin Heßler

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.01.014

zbMATH Keywords

dynamic programminglinear time complexitymaximum gap problempicker routing problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses

Cites Work

• Design and control of warehouse order picking: a literature review
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Routing methods for warehouses with multiple cross aisles
• Routing order pickers in a warehouse with a middle aisle
• Unnamed Item

This page was built for publication: A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing