Robotic Sorting Systems: Performance Estimation and Operating Policies Analysis

吞吐量 计算机科学 分类 机器人 分类 排队 最短路径问题 排队论 网络拓扑 路径(计算) 拓扑(电路) 实时计算 分布式计算 工程类 图形 计算机网络 算法 人工智能 电信 理论计算机科学 电气工程 无线 情报检索
作者
Bipan Zou,René de Koster,Yeming Gong,Xianhao Xu,Guwen Shen
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
卷期号:55 (6): 1430-1455 被引量:47
标识
DOI:10.1287/trsc.2021.1053
摘要

Many distribution centers use expensive, conveyor-based sorting systems that require large buildings to house them. In areas with tight space, robotic sorting systems offer a new type of solution to sort parcels by destination. Such systems are highly flexible in throughput capacity and are now gradually being introduced, particularly in express companies. This paper studies robotic sorting system with two layouts. The first layout has two tiers: robots drive on the top tier and sort parcels by destination on spiral conveyors connected to roll containers at the lower tier. The second layout has a single tier with input and output points located at the perimeter, connected by robots. For each layout, we consider both the shortest path topology via dual-lane aisles and the detour path topology via single-lane aisles. We build closed queueing networks for performance estimation, design an iterative procedure to investigate robot congestion in the two-tier layout, and use a traffic flow function to estimate robot congestion in the single-tier layout. Random, closest, dedicated, and shortest-queue robot-to-loading-station assignment rules are examined. We validate analytical models by both simulation and a real case of Deppon Express and analyze the optimal system size and operating policies for throughput capacity and operating cost. The results show that the system throughput capacity is significantly affected by robot congestion in the single-tier layout with the detour path topology, but it is only slightly affected in the other systems. A square layout fits the shortest path and a rectangular layout fits the detour path. Both the random assignment rule and the shortest-queue assignment rule are superior for a large number of robots, whereas the dedicated assignment rule is superior for a small number of robots. We apply these insights at Deppon Express for different allocations in peak and off-peak hours. Our analysis shows that a robotic sorting system typically has lower overall annual cost than a traditional cross-belt sorting system when the required throughput capacity is not too large.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
未来发布了新的文献求助10
刚刚
shenlu完成签到,获得积分10
刚刚
syjjj完成签到,获得积分10
刚刚
扑火飞蛾完成签到,获得积分10
刚刚
有魅力的白玉完成签到 ,获得积分10
刚刚
123完成签到 ,获得积分10
1秒前
暖暖完成签到,获得积分10
1秒前
元气土豆完成签到,获得积分10
1秒前
ZDSHI完成签到,获得积分10
1秒前
ty完成签到,获得积分10
1秒前
2秒前
凌凌凌完成签到,获得积分10
2秒前
平安完成签到 ,获得积分10
3秒前
所所应助安静又夏采纳,获得10
3秒前
Rain完成签到,获得积分10
3秒前
tww完成签到 ,获得积分10
4秒前
QIEZI完成签到 ,获得积分10
4秒前
hanshuwen完成签到,获得积分10
4秒前
七颗茶香豆完成签到,获得积分10
4秒前
5秒前
愉情完成签到,获得积分10
5秒前
风趣紫烟完成签到,获得积分10
5秒前
黄奥龙发布了新的文献求助10
5秒前
5秒前
热心安完成签到,获得积分10
6秒前
徐向成完成签到,获得积分10
6秒前
徐柯完成签到 ,获得积分10
6秒前
周雪完成签到 ,获得积分10
6秒前
7秒前
森sen完成签到 ,获得积分10
7秒前
飞飞完成签到,获得积分10
7秒前
Lndbn发布了新的文献求助10
7秒前
yuliang完成签到,获得积分20
8秒前
义气敏完成签到,获得积分20
8秒前
ddd完成签到 ,获得积分10
8秒前
PsyQin完成签到,获得积分10
8秒前
冰冰完成签到,获得积分10
8秒前
8秒前
pdf123完成签到,获得积分10
8秒前
FANPENG完成签到,获得积分10
9秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Nine new races of Peronospora manshurica found on soybeans in the Midwest 1000
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 600
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Eudora Welty and Modern Media 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 化学工程 工程类 有机化学 物理 复合材料 生物化学 内科学 细胞生物学 基因 遗传学 免疫学 冶金 光电子学 癌症研究
热门帖子
关注 科研通微信公众号,转发送积分 7772821
求助须知:如何正确求助?哪些是违规求助? 9314946
关于积分的说明 20341764
捐赠科研通 7358418
什么是DOI,文献DOI怎么找? 3317064
关于科研通互助平台的介绍 2465590
邀请新用户注册赠送积分活动 2332102