Preprints, Working Papers, ... Year : 2023

The Intractability of the Picker Routing Problem

Abstract

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.

Dates and versions

hal-04394208 , version 1 (15-01-2024)

Licence

Identifiers

Cite

Thibault Prunet, Nabil Absi, Diego Cattaruzza. The Intractability of the Picker Routing Problem. 2024. ⟨hal-04394208⟩
35 View
0 Download

Altmetric

Share

More