Optimal Retrieval in Puzzle-Based Storage Systems Using Automated Mobile Robots

整数规划 线性规划 启发式 计算机科学 块(置换群论) 网格 数学优化 移动机器人 机器人 实时计算 数学 算法 人工智能 几何学
作者
Tal Raviv,Yossi Bukchin,René de Koster
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
卷期号:57 (2): 424-443 被引量:2
标识
DOI:10.1287/trsc.2022.1169
摘要

Puzzle-based storage (PBS) systems store unit loads at very high density, without consuming space for transport aisles. In such systems, each load is stored on a moving device (conveyor module or transport vehicle), making these systems very expensive to build and maintain. This paper studies a new type of PBS system where loads are moved by a small number of autonomous mobile robots (AMRs). The AMRs (or vehicles) can travel freely underneath loads and lift a specific load and carry it to a neighboring vacant space. These systems are hard to analyze, as all the AMRs can move simultaneously with or without loads. We formulate an integer linear programming model that minimizes the retrieval time and the number of load and vehicle movements. The proposed model can handle single-load movements as well as block movements, multiple input/output points, and various constraints on simultaneous vehicle movements. The integer linear programming formulation can solve relatively small problems (a grid with up to about 50 cells) and a sufficient number of empty cells. For larger systems or those with few empty cells, a three-phase heuristic (3PH) is developed, which significantly outperforms the heuristic methods known to date and solves large instances sufficiently fast. The 3PH and an additional hybrid heuristic yield relatively small gaps from a lower bound provided by the integer linear programming model. We find that increasing the number of vehicles has a diminishing return effect on the retrieval times. Using a relatively small number of vehicles makes retrieval times only slightly longer than those obtained when having a vehicle under each load (which is equivalent to the traditional PBS systems). With single-load movement, more vehicles are needed compared with block movement to reach short retrieval times. Also, the marginal contribution of extra empty slots appears to decrease rapidly, which implies high storage densities can be obtained in practice.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
翠翠发布了新的文献求助10
2秒前
童道之完成签到 ,获得积分10
3秒前
化尔为鸟其名为鹏完成签到 ,获得积分10
7秒前
大力的契完成签到,获得积分10
10秒前
翠翠完成签到,获得积分10
12秒前
13秒前
曾经小伙完成签到 ,获得积分10
14秒前
朴素若枫完成签到,获得积分10
16秒前
17秒前
顾绍飞发布了新的文献求助30
19秒前
19秒前
20秒前
大地上的鱼完成签到,获得积分10
21秒前
21秒前
热情思天发布了新的文献求助10
22秒前
ZhonghanWen发布了新的文献求助10
24秒前
25秒前
过时的电灯胆完成签到 ,获得积分10
26秒前
酷波er应助amerla采纳,获得10
27秒前
宾周发布了新的文献求助30
27秒前
俄而完成签到 ,获得积分10
28秒前
绿色催化完成签到,获得积分10
29秒前
30秒前
飘逸妙柏发布了新的文献求助10
30秒前
文艺的小海豚完成签到,获得积分10
31秒前
晚风完成签到 ,获得积分10
33秒前
可爱的函函应助ZhonghanWen采纳,获得10
33秒前
闻元杰完成签到,获得积分10
34秒前
顾绍飞完成签到,获得积分20
34秒前
ZZZ完成签到,获得积分10
34秒前
35秒前
李健的小迷弟应助糊涂采纳,获得10
35秒前
gy发布了新的文献求助10
38秒前
飘逸妙柏完成签到,获得积分10
42秒前
liyi2022完成签到,获得积分10
43秒前
小周完成签到 ,获得积分10
43秒前
45秒前
星火完成签到,获得积分10
46秒前
49秒前
所所应助科研通管家采纳,获得10
49秒前
高分求助中
【此为提示信息,请勿应助】请按要求发布求助,避免被关 20000
Production Logging: Theoretical and Interpretive Elements 3000
CRC Handbook of Chemistry and Physics 104th edition 1000
Izeltabart tapatansine - AdisInsight 600
Introduction to Comparative Public Administration Administrative Systems and Reforms in Europe, Third Edition 3rd edition 500
Distinct Aggregation Behaviors and Rheological Responses of Two Terminally Functionalized Polyisoprenes with Different Quadruple Hydrogen Bonding Motifs 450
Individualized positive end-expiratory pressure in laparoscopic surgery: a randomized controlled trial 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 物理 生物化学 纳米技术 计算机科学 化学工程 内科学 复合材料 物理化学 电极 遗传学 量子力学 基因 冶金 催化作用
热门帖子
关注 科研通微信公众号,转发送积分 3761753
求助须知:如何正确求助?哪些是违规求助? 3305518
关于积分的说明 10134626
捐赠科研通 3019564
什么是DOI,文献DOI怎么找? 1658226
邀请新用户注册赠送积分活动 791974
科研通“疑难数据库(出版商)”最低求助积分说明 754751