Performance Analysis of Multi-Tote Storage and Retrieval Autonomous Mobile Robot Systems

吞吐量 排队论 计算机科学 布线(电子设计自动化) 机器人 启发式 工作站 实时计算 模拟 计算机网络 人工智能 操作系统 无线
作者
Zhizhen Qin,Peng Yang,Yeming Gong,René de Koster
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
卷期号:58 (5): 1033-1055 被引量:6
标识
DOI:10.1287/trsc.2023.0397
摘要

Multi-tote storage and retrieval (MTSR) autonomous mobile robots can carry multiple product totes, store and retrieve them from different shelf rack tiers, and transport them to a workstation where the products are picked to fulfill customer orders. In each robot trip, totes retrieved during the previous trip must be stored. This leads to a mixed storage and retrieval route. We analyze this mixed storage and retrieval route problem and derive the optimal travel route for a multiblock warehouse by a layered graph algorithm, based on storage first-retrieval second and mixed storage and retrieval policies. We also propose an effective heuristic routing policy, the closest retrieval (CR) sequence policy, based on a local shortest path. Numerical results show that the CR policy leads to shorter travel times than the well-known S-shape policy, whereas the gap with the optimal mixed storage and retrieval policy in practical scenarios is small. Based on the CR policy, we model the stochastic behavior of the system using a semiopen queuing network (SOQN). This model can accurately estimate average tote throughput time and system throughput capacity as a function of the number of robots in the system. We use the SOQN and corresponding closed queuing network models to optimize the total annual cost as a function of the warehouse shape, the number of robots, and tote buffer positions on the robots for a given average tote throughput time and throughput capacity. Compared with robots that retrieve a single tote per trip, an MTSR system with at least five buffer positions can achieve lower operational costs while meeting given average tote throughput time and tote throughput capacity constraints. Funding: This work was supported by National Natural Science Foundation of China [Grant 72372088] and the Shenzhen Science and Technology Program [Grant GJHZ20220913143003006]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0397 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
宁宁完成签到,获得积分10
刚刚
蒸馏水完成签到,获得积分10
1秒前
qiqimax完成签到,获得积分10
1秒前
川奈天吾完成签到,获得积分10
1秒前
2秒前
joycelin发布了新的文献求助10
2秒前
努力的学完成签到,获得积分10
4秒前
gaoqg完成签到,获得积分10
4秒前
有人发布了新的文献求助200
5秒前
feiyue126发布了新的文献求助10
6秒前
科研通AI6.2的应助被fghgg采纳,获得30
6秒前
小黄鸭完成签到,获得积分10
7秒前
7秒前
10秒前
木心o完成签到,获得积分10
10秒前
优雅的帅哥完成签到 ,获得积分10
11秒前
无花果的应助被joycelin采纳,获得10
11秒前
kong完成签到,获得积分10
12秒前
xiaoze完成签到 ,获得积分10
12秒前
小吕完成签到,获得积分10
13秒前
丑麒完成签到,获得积分10
13秒前
燕天与完成签到,获得积分10
14秒前
忧心的峻熙完成签到,获得积分10
14秒前
MASAMI完成签到,获得积分10
15秒前
守心尊礼完成签到,获得积分0
15秒前
时尚黄豆完成签到 ,获得积分10
16秒前
shouyu29的应助被科研通管家采纳,获得10
16秒前
梦舞生汐完成签到,获得积分10
16秒前
烟花的应助被科研通管家采纳,获得10
16秒前
sialiangwei的应助被科研通管家采纳,获得10
16秒前
爆米花的应助被科研通管家采纳,获得10
16秒前
DW的应助被科研通管家采纳,获得10
16秒前
FashionBoy的应助被科研通管家采纳,获得10
17秒前
17秒前
17秒前
Zoeyren完成签到,获得积分10
17秒前
成就鑫发布了新的文献求助10
18秒前
余慵慵完成签到 ,获得积分10
18秒前
WMH9169完成签到 ,获得积分10
18秒前
幽默的山柏完成签到,获得积分20
19秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Nanocomposite Removal of Pesticides from Wastewater 2000
Электротехническая система магнитожидкостной герметизации валов регулируемых электродвигателей 800
日本語と中国語及びチベット・ビルマ語の語源関連性に関する分析 800
Practical Manual of Forensic Psychophysiology: Methodology, Execution, and Fields of Application 800
Holistic Discourse Analysis, Second Edition by Robert E. Longacre 666
The Basics of Practical Optimization, Second Edition 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 计算机科学 工程类 纳米技术 有机化学 物理 生物化学 化学工程 内科学 复合材料 催化作用 心理学 人工智能 细胞生物学 光电子学 无机化学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 7941059
求助须知:如何正确求助?哪些是违规求助? 9425583
关于积分的说明 20971591
捐赠科研通 7528928
什么是DOI,文献DOI怎么找? 3367466
关于科研通互助平台的介绍 2504361
邀请新用户注册赠送积分活动 2399242