Optimal picker routes in rectangular warehouses never require double traversal of a subaisle to connect horizontal travel, for any number of cross-aisles.
A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In the order picking problem, a picker has to collect a number of products in a warehouse with a minimum length tour. Ratliff and Rosenthal gave a linear algorithm solving the order picking problem in the case where the warehouse has two cross aisles. Their algorithm allow the tour to double cross an entire aisle. We prove that, in rectangular warehouses, there always exists a minimum length tour which doesn't double cross an aisle.
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Double Traversals in Optimal Picker Routes for Warehouses with Multiple Blocks
Optimal picker routes in rectangular warehouses never require double traversal of a subaisle to connect horizontal travel, for any number of cross-aisles.