关于Ratliff和Rosenthal的矩形仓库拣货算法的一个过渡说明

IF 0.8 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Operations Research Letters Pub Date : 2025-06-27 DOI:10.1016/j.orl.2025.107325

Paul Revenant , Hadrien Cambazard , Nicolas Catusse

{"title":"关于Ratliff和Rosenthal的矩形仓库拣货算法的一个过渡说明","authors":"Paul Revenant , Hadrien Cambazard , Nicolas Catusse","doi":"10.1016/j.orl.2025.107325","DOIUrl":null,"url":null,"abstract":"<div><div>The order picking problem involves determining the shortest tour for a picker to collect a set of products in a warehouse. Ratliff and Rosenthal introduced a linear algorithm to solve this problem for warehouses with two cross aisles, allowing for tours that double-cross entire aisles. In this paper, we prove that in rectangular warehouses, a minimum-length tour always exists that avoids double-crossing any aisle. This result simplifies the problem by eliminating redundant configurations.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"62 ","pages":"Article 107325"},"PeriodicalIF":0.8000,"publicationDate":"2025-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses\",\"authors\":\"Paul Revenant , Hadrien Cambazard , Nicolas Catusse\",\"doi\":\"10.1016/j.orl.2025.107325\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The order picking problem involves determining the shortest tour for a picker to collect a set of products in a warehouse. Ratliff and Rosenthal introduced a linear algorithm to solve this problem for warehouses with two cross aisles, allowing for tours that double-cross entire aisles. In this paper, we prove that in rectangular warehouses, a minimum-length tour always exists that avoids double-crossing any aisle. This result simplifies the problem by eliminating redundant configurations.</div></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"62 \",\"pages\":\"Article 107325\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2025-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167637725000860\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637725000860","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

订单拣货问题涉及确定拣货员在仓库中收集一组产品的最短行程。Ratliff和Rosenthal引入了一种线性算法来解决有两个交叉通道的仓库的这个问题，允许双向穿越整个通道。在本文中，我们证明了在矩形仓库中，一个最小长度的旅行总是存在的，它避免了任何通道的重复穿越。该结果通过消除冗余配置简化了问题。

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

查看原文本刊更多论文

A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses

The order picking problem involves determining the shortest tour for a picker to collect a set of products in a warehouse. Ratliff and Rosenthal introduced a linear algorithm to solve this problem for warehouses with two cross aisles, allowing for tours that double-cross entire aisles. In this paper, we prove that in rectangular warehouses, a minimum-length tour always exists that avoids double-crossing any aisle. This result simplifies the problem by eliminating redundant configurations.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Operations Research Letters 管理科学-运筹学与管理科学

CiteScore

2.10

自引率

9.10%

发文量

111

审稿时长

83 days

期刊介绍： Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.