Online joint optimization of order picking process in robotic mobile fulfillment systems

IF 7.2 2区 管理学 Q1 MANAGEMENT
Guoshuai Jiao , Min Huang , Yang Song , Haobin Li , Xingwei Wang
{"title":"Online joint optimization of order picking process in robotic mobile fulfillment systems","authors":"Guoshuai Jiao ,&nbsp;Min Huang ,&nbsp;Yang Song ,&nbsp;Haobin Li ,&nbsp;Xingwei Wang","doi":"10.1016/j.omega.2025.103374","DOIUrl":null,"url":null,"abstract":"<div><div>A robotic mobile fulfillment system (RMFS) constitutes a highly intricate and interdependent decision-making system, encompassing numerous closely related and interacting decision challenges. Meanwhile, RMFS is a prime example of a dynamic system in which various types of information, such as inventory levels, order backlogs, robot statuses, and pod locations, continuously change throughout operation. This study focuses on the online decision-making process for joint optimization of order assignment, pod selection, and task allocation within RMFS during the order-picking process. Additionally, it considers the influence of current decisions on future decisions to improve online decision-making efficiency. Initially, a dynamic system model for RMFS is developed. Subsequently, a novel mixed-integer linear programming (MILP) model is formulated to address this critical order-picking challenge effectively. Furthermore, a customized heuristic approach, employing alternating decision-making and greedy selection techniques, is proposed to overcome computational challenges associated with larger-scale RMFS scenarios. In different scales, the proposed approach outperforms a sequential approach commonly used in practice and a MILP model in existing literature for online joint optimization of order assignment and pod selection. The findings highlight the efficacy of the proposed approach in optimizing the RMFS order-picking process, particularly for larger instances, delivering significant benefits in terms of increased throughput and reduced robot travel distances.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"138 ","pages":"Article 103374"},"PeriodicalIF":7.2000,"publicationDate":"2025-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Omega-international Journal of Management Science","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305048325001008","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

A robotic mobile fulfillment system (RMFS) constitutes a highly intricate and interdependent decision-making system, encompassing numerous closely related and interacting decision challenges. Meanwhile, RMFS is a prime example of a dynamic system in which various types of information, such as inventory levels, order backlogs, robot statuses, and pod locations, continuously change throughout operation. This study focuses on the online decision-making process for joint optimization of order assignment, pod selection, and task allocation within RMFS during the order-picking process. Additionally, it considers the influence of current decisions on future decisions to improve online decision-making efficiency. Initially, a dynamic system model for RMFS is developed. Subsequently, a novel mixed-integer linear programming (MILP) model is formulated to address this critical order-picking challenge effectively. Furthermore, a customized heuristic approach, employing alternating decision-making and greedy selection techniques, is proposed to overcome computational challenges associated with larger-scale RMFS scenarios. In different scales, the proposed approach outperforms a sequential approach commonly used in practice and a MILP model in existing literature for online joint optimization of order assignment and pod selection. The findings highlight the efficacy of the proposed approach in optimizing the RMFS order-picking process, particularly for larger instances, delivering significant benefits in terms of increased throughput and reduced robot travel distances.
机器人移动履约系统中拣货过程的在线联合优化
机器人移动履约系统(RMFS)是一个高度复杂和相互依赖的决策系统,包含了许多密切相关和相互作用的决策挑战。同时,RMFS是一个动态系统的典型例子,其中各种类型的信息,如库存水平、订单积压、机器人状态和pod位置,在整个操作过程中不断变化。本文主要研究了RMFS拣单过程中订单分配、吊舱选择和任务分配联合优化的在线决策过程。同时考虑当前决策对未来决策的影响,提高在线决策效率。首先,建立了RMFS的动态系统模型。随后,提出了一种新的混合整数线性规划(MILP)模型来有效地解决这一关键的订单选择挑战。此外,提出了一种采用交替决策和贪婪选择技术的自定义启发式方法,以克服与更大规模RMFS场景相关的计算挑战。在不同尺度下,该方法优于实践中常用的顺序方法和现有文献中的MILP模型,用于顺序分配和pod选择的在线联合优化。研究结果强调了所提出的方法在优化RMFS订单挑选过程中的有效性,特别是对于较大的实例,在提高吞吐量和减少机器人旅行距离方面提供了显着的好处。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Omega-international Journal of Management Science
Omega-international Journal of Management Science 管理科学-运筹学与管理科学
CiteScore
13.80
自引率
11.60%
发文量
130
审稿时长
56 days
期刊介绍: Omega reports on developments in management, including the latest research results and applications. Original contributions and review articles describe the state of the art in specific fields or functions of management, while there are shorter critical assessments of particular management techniques. Other features of the journal are the "Memoranda" section for short communications and "Feedback", a correspondence column. Omega is both stimulating reading and an important source for practising managers, specialists in management services, operational research workers and management scientists, management consultants, academics, students and research personnel throughout the world. The material published is of high quality and relevance, written in a manner which makes it accessible to all of this wide-ranging readership. Preference will be given to papers with implications to the practice of management. Submissions of purely theoretical papers are discouraged. The review of material for publication in the journal reflects this aim.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信