A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses

Hadrien Cambazard (G-SCOP); Nicolas Catusse (G-SCOP); Paul Revenant (ENS de Lyon)

A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.15464 v1 pith:P6B3PBKX submitted 2024-05-24 math.OC

Paul Revenant (ENS de Lyon) , Hadrien Cambazard (G-SCOP) , Nicolas Catusse (G-SCOP) This is my paper · ORCID

classification math.OC

keywords algorithmcrossorderpickingtouraisledoublelength

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Double Traversals in Optimal Picker Routes for Warehouses with Multiple Blocks
math.OC 2025-01 conditional novelty 6.0 of 10

Optimal picker routes in rectangular warehouses never require double traversal of a subaisle to connect horizontal travel, for any number of cross-aisles.

Pith tools