A note on the complexity of the picker routing problem in multi-block warehouses and related problems
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916580322967552 |
|---|---|
| author | Prunet, Thibault Absi, Nabil Cattaruzza, Diego |
| author_facet | Prunet, Thibault Absi, Nabil Cattaruzza, Diego |
| contents | The Picker Routing Problem (PRP), which consists of finding a minimum-length tour between a set of storage locations in a warehouse, is one of the most important problems in the warehousing logistics literature. Despite its popularity, the tractability of the PRP in multi-block warehouses remains an open question. This technical note aims to fill this research gap by establishing that the problem is strongly NP-hard. As a corollary, the complexity status of other related problems is settled. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_01857 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A note on the complexity of the picker routing problem in multi-block warehouses and related problems Prunet, Thibault Absi, Nabil Cattaruzza, Diego Data Structures and Algorithms Computational Complexity Optimization and Control The Picker Routing Problem (PRP), which consists of finding a minimum-length tour between a set of storage locations in a warehouse, is one of the most important problems in the warehousing logistics literature. Despite its popularity, the tractability of the PRP in multi-block warehouses remains an open question. This technical note aims to fill this research gap by establishing that the problem is strongly NP-hard. As a corollary, the complexity status of other related problems is settled. |
| title | A note on the complexity of the picker routing problem in multi-block warehouses and related problems |
| topic | Data Structures and Algorithms Computational Complexity Optimization and Control |
| url | https://arxiv.org/abs/2312.01857 |