A note on the complexity of the picker routing problem in multi-block warehouses and related problems

IF 4.4 3区管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Annals of Operations Research Pub Date : 2025-01-24 DOI:10.1007/s10479-025-06481-3

Thibault Prunet, Nabil Absi, Diego Cattaruzza

引用次数: 0

Abstract

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.

查看原文本刊更多论文

关于多块仓库中拣选机路由问题的复杂性及相关问题的说明

Picker Routing Problem （PRP）是仓储物流文献中最重要的问题之一，它包括在仓库的一组存储位置之间寻找最小长度的行程。尽管它很受欢迎，但PRP在多块仓库中的可追溯性仍然是一个悬而未决的问题。本技术说明旨在通过确定该问题是强NP-hard来填补这一研究空白。作为必然结果，其他相关问题的复杂性状况也得到了解决。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Annals of Operations Research 管理科学-运筹学与管理科学

CiteScore

7.90

自引率

16.70%

发文量

596

审稿时长

8.4 months

期刊介绍： The Annals of Operations Research publishes peer-reviewed original articles dealing with key aspects of operations research, including theory, practice, and computation. The journal publishes full-length research articles, short notes, expositions and surveys, reports on computational studies, and case studies that present new and innovative practical applications. In addition to regular issues, the journal publishes periodic special volumes that focus on defined fields of operations research, ranging from the highly theoretical to the algorithmic and the applied. These volumes have one or more Guest Editors who are responsible for collecting the papers and overseeing the refereeing process.