Double Traversals in Boundary Subaisles: Implications for Two-Block Layouts
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911523985686528 |
|---|---|
| author | Dunn, George Stojanovski, Elizabeth Lamichhane, Bishnu Charkhgard, Hadi Eshragh, Ali |
| author_facet | Dunn, George Stojanovski, Elizabeth Lamichhane, Bishnu Charkhgard, Hadi Eshragh, Ali |
| contents | The order picking problem seeks the shortest warehouse route that visits all required item locations. Strict conditions are known for single-block rectangular layouts under which optimal routes never require double traversals, while broader results show that double traversals serving cross-aisle connectivity can always be avoided. We strengthen these findings by proving that no double traversals are needed in the boundary subaisles, the uppermost and lowermost subaisle segments, of warehouses with at least two non-empty aisles. This yields a unified strict condition for all single-block layouts and for two-block layouts with more than one aisle. For these widely used layouts, exact methods such as dynamic programming and mathematical programming can therefore exclude the double-traversal configuration from every boundary subaisle, reducing the number of admissible edge configurations without loss of optimality. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_08235 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Double Traversals in Boundary Subaisles: Implications for Two-Block Layouts Dunn, George Stojanovski, Elizabeth Lamichhane, Bishnu Charkhgard, Hadi Eshragh, Ali Optimization and Control The order picking problem seeks the shortest warehouse route that visits all required item locations. Strict conditions are known for single-block rectangular layouts under which optimal routes never require double traversals, while broader results show that double traversals serving cross-aisle connectivity can always be avoided. We strengthen these findings by proving that no double traversals are needed in the boundary subaisles, the uppermost and lowermost subaisle segments, of warehouses with at least two non-empty aisles. This yields a unified strict condition for all single-block layouts and for two-block layouts with more than one aisle. For these widely used layouts, exact methods such as dynamic programming and mathematical programming can therefore exclude the double-traversal configuration from every boundary subaisle, reducing the number of admissible edge configurations without loss of optimality. |
| title | Double Traversals in Boundary Subaisles: Implications for Two-Block Layouts |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2512.08235 |