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

整数规划 线性规划 启发式 计算机科学 块(置换群论) 网格 数学优化 移动机器人 机器人 Lift(数据挖掘) 实时计算 模拟 数学 算法 人工智能 数据挖掘 几何学
作者
Tal Raviv,Yossi Bukchin,René de Koster
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
卷期号:57 (2): 424-443 被引量:1
标识
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
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
徐小鑫完成签到 ,获得积分10
刚刚
Wcc完成签到,获得积分10
1秒前
1秒前
李连杰举报hyg求助涉嫌违规
1秒前
wangke完成签到,获得积分10
2秒前
meimale完成签到,获得积分10
2秒前
刻苦大叔完成签到,获得积分10
2秒前
小可爱完成签到,获得积分10
3秒前
呆萌豌豆完成签到 ,获得积分10
4秒前
罗_完成签到,获得积分0
4秒前
研友_LMBAXn完成签到,获得积分10
4秒前
科研通AI2S应助qiul采纳,获得10
5秒前
滕青寒完成签到,获得积分10
6秒前
rocky15应助刻苦大叔采纳,获得10
7秒前
瓦斯兰德笑川皇完成签到,获得积分10
9秒前
英姑应助晚风采纳,获得10
11秒前
李连杰举报求助违规成功
11秒前
wkjfh举报求助违规成功
11秒前
紫金大萝卜举报求助违规成功
11秒前
11秒前
hatchio完成签到,获得积分10
11秒前
12秒前
香蕉觅云应助zzn采纳,获得10
13秒前
熊猫完成签到,获得积分10
14秒前
优等生完成签到 ,获得积分20
15秒前
高海龙完成签到 ,获得积分10
15秒前
jx完成签到 ,获得积分10
16秒前
cenzy完成签到,获得积分10
17秒前
zhao完成签到,获得积分10
17秒前
如意的问枫完成签到 ,获得积分10
17秒前
suiwuya完成签到,获得积分10
18秒前
19秒前
不想上班了完成签到,获得积分20
24秒前
神奇海螺完成签到,获得积分10
24秒前
吃书的猪完成签到,获得积分10
24秒前
piano呀完成签到 ,获得积分20
25秒前
嘻嘻完成签到,获得积分10
25秒前
明亮巨人完成签到 ,获得积分10
25秒前
喵喵完成签到,获得积分10
25秒前
在望完成签到,获得积分10
27秒前
高分求助中
Un calendrier babylonien des travaux, des signes et des mois: Séries iqqur îpuš 1036
Quantum Science and Technology Volume 5 Number 4, October 2020 1000
Formgebungs- und Stabilisierungsparameter für das Konstruktionsverfahren der FiDU-Freien Innendruckumformung von Blech 1000
IG Farbenindustrie AG and Imperial Chemical Industries Limited strategies for growth and survival 1925-1953 800
Sustainable Land Management: Strategies to Cope with the Marginalisation of Agriculture 600
Prochinois Et Maoïsmes En France (et Dans Les Espaces Francophones) 500
Offline version of the Proceedings of 15th EWTEC 2023, Bilbao 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2525243
求助须知:如何正确求助?哪些是违规求助? 2166413
关于积分的说明 5557177
捐赠科研通 1886664
什么是DOI,文献DOI怎么找? 939510
版权声明 564588
科研通“疑难数据库(出版商)”最低求助积分说明 501081