The storage location assignment and picker routing problem: A generic branch-cut-and-price algorithm

IF 6 2区管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

European Journal of Operational Research Pub Date : 2025-06-16 DOI:10.1016/j.ejor.2025.05.041

Thibault Prunet, Nabil Absi, Diego Cattaruzza

{"title":"The storage location assignment and picker routing problem: A generic branch-cut-and-price algorithm","authors":"Thibault Prunet, Nabil Absi, Diego Cattaruzza","doi":"10.1016/j.ejor.2025.05.041","DOIUrl":null,"url":null,"abstract":"The <ce:italic>Storage Location Assignment Problem</ce:italic> (SLAP) and the <ce:italic>Picker Routing Problem</ce:italic> (PRP) have received significant attention in the literature due to their pivotal role in the performance of the <ce:italic>Order Picking</ce:italic> (OP) activity, the most resource-intensive process of warehousing logistics. The two problems are traditionally considered at different decision-making levels: tactical for the SLAP, and operational for the PRP. However, this paradigm has been challenged by the emergence of modern practices in e-commerce warehouses, where decisions are more dynamic. This shift makes the integrated problem, called the <ce:italic>Storage Location Assignment and Picker Routing Problem</ce:italic> (SLAPRP), pertinent to consider. Scholars have investigated several variants of the SLAPRP, including different warehouse layouts and routing policies. Nevertheless, the available computational results suggest that each variant requires an ad-hoc formulation. Moreover, achieving a complete integration of the two problems, where the routing is solved optimally, remains out of reach for commercial solvers, even on trivial instances.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"17 1","pages":""},"PeriodicalIF":6.0000,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Operational Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1016/j.ejor.2025.05.041","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

Abstract

The Storage Location Assignment Problem (SLAP) and the Picker Routing Problem (PRP) have received significant attention in the literature due to their pivotal role in the performance of the Order Picking (OP) activity, the most resource-intensive process of warehousing logistics. The two problems are traditionally considered at different decision-making levels: tactical for the SLAP, and operational for the PRP. However, this paradigm has been challenged by the emergence of modern practices in e-commerce warehouses, where decisions are more dynamic. This shift makes the integrated problem, called the Storage Location Assignment and Picker Routing Problem (SLAPRP), pertinent to consider. Scholars have investigated several variants of the SLAPRP, including different warehouse layouts and routing policies. Nevertheless, the available computational results suggest that each variant requires an ad-hoc formulation. Moreover, achieving a complete integration of the two problems, where the routing is solved optimally, remains out of reach for commercial solvers, even on trivial instances.

查看原文本刊更多论文

存储位置分配和选择器路由问题：一种通用的分支降价算法

仓储位置分配问题（SLAP）和拣选者路线问题（PRP）在文献中受到了极大的关注，因为它们在订单拣选（OP）活动的表现中起着关键作用，这是仓储物流中资源最密集的过程。传统上，这两个问题是在不同的决策层面考虑的：SLAP是战术层面的，PRP是操作层面的。然而，这种模式受到电子商务仓库中出现的现代实践的挑战，其中的决策更具动态性。这种转变使得集成问题，称为存储位置分配和选择路由问题（SLAPRP），值得考虑。学者们研究了SLAPRP的几种变体，包括不同的仓库布局和路由策略。然而，现有的计算结果表明，每个变体都需要一个特别的公式。此外，实现这两个问题的完全集成，使路由得到最佳解决，对于商业解决方案来说仍然是遥不可及的，即使是在微不足道的实例上。

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

求助全文

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

来源期刊

European Journal of Operational Research 管理科学-运筹学与管理科学

CiteScore

11.90

自引率

9.40%

发文量

786

审稿时长

8.2 months

期刊介绍： The European Journal of Operational Research (EJOR) publishes high quality, original papers that contribute to the methodology of operational research (OR) and to the practice of decision making.