تقرير
The Intractability of the Picker Routing Problem
| العنوان: | The Intractability of the Picker Routing Problem |
|---|---|
| المؤلفون: | Prunet, Thibault, Absi, Nabil, Cattaruzza, Diego |
| سنة النشر: | 2023 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, Mathematics - Optimization and Control |
| الوصف: | The Picker Routing Problem (PRP), which consists in 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 conventional multi-block warehouses remains an open question. This technical note aims to fill this research gap by establishing that the PRP is strongly NP-hard. |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2312.01857 |
| رقم الأكسشن: | edsarx.2312.01857 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |