The Intractability of the Picker Routing Problem
Document type :
Pré-publication ou Document de travail
Title :
The Intractability of the Picker Routing Problem
Author(s) :
Prunet, Thibault [Auteur]
Département Sciences de la Fabrication et Logistique [SFL-ENSMSE]
Absi, Nabil [Auteur]
Département Sciences de la Fabrication et Logistique [SFL-ENSMSE]
Cattaruzza, Diego [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Département Sciences de la Fabrication et Logistique [SFL-ENSMSE]
Absi, Nabil [Auteur]
Département Sciences de la Fabrication et Logistique [SFL-ENSMSE]
Cattaruzza, Diego [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Publication date :
2023
English keyword(s) :
Picker Routing Problem
Warehouse Management
Warehouse Management
HAL domain(s) :
Informatique [cs]
Mathématiques [math]
Mathématiques [math]
English abstract : [en]
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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Collections :
Source :
Files
- 2312.01857
- Open access
- Access the document