Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.15464 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909210061570048 |
|---|---|
| author | Revenant, Paul Cambazard, Hadrien Catusse, Nicolas |
| author_facet | Revenant, Paul Cambazard, Hadrien Catusse, Nicolas |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_15464 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses Revenant, Paul Cambazard, Hadrien Catusse, Nicolas Optimization and Control 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. |
| title | A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2405.15464 |