A Modified Algorithm for Optimal Picker Routing in a Single Block Warehouse
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909320651735040 |
|---|---|
| author | Dunn, George Charkhgard, Hadi Eshragh, Ali Stojanovski, Elizabeth |
| author_facet | Dunn, George Charkhgard, Hadi Eshragh, Ali Stojanovski, Elizabeth |
| contents | The order picker routing problem involves finding the optimal tour of a warehouse that collects all the required items on a given pick list. Ratliff and Rosenthal introduced a dynamic programming algorithm for solving this problem in polynomial time by sequentially adding edges inside and between each aisle to construct a tour. We provide a method where only transitions from one aisle to the next are considered, significantly reducing the number of stages in the algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_13219 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Modified Algorithm for Optimal Picker Routing in a Single Block Warehouse Dunn, George Charkhgard, Hadi Eshragh, Ali Stojanovski, Elizabeth Optimization and Control The order picker routing problem involves finding the optimal tour of a warehouse that collects all the required items on a given pick list. Ratliff and Rosenthal introduced a dynamic programming algorithm for solving this problem in polynomial time by sequentially adding edges inside and between each aisle to construct a tour. We provide a method where only transitions from one aisle to the next are considered, significantly reducing the number of stages in the algorithm. |
| title | A Modified Algorithm for Optimal Picker Routing in a Single Block Warehouse |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2409.13219 |