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
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
活泼新儿完成签到 ,获得积分10
3秒前
晓晓完成签到 ,获得积分10
4秒前
komisan完成签到 ,获得积分10
5秒前
5秒前
fish完成签到,获得积分10
6秒前
痴情的从雪完成签到,获得积分10
6秒前
苏鱼完成签到 ,获得积分10
7秒前
研友_8yVV0L完成签到 ,获得积分10
8秒前
8秒前
小时完成签到 ,获得积分10
9秒前
无情悟空完成签到,获得积分10
10秒前
哈哈完成签到,获得积分10
11秒前
infinite完成签到,获得积分10
11秒前
DOGDAD完成签到,获得积分10
11秒前
11秒前
鲁彦华发布了新的文献求助20
14秒前
嗯哼应助Mojito采纳,获得20
14秒前
yqhide完成签到,获得积分10
15秒前
16秒前
机灵的成协完成签到,获得积分10
17秒前
星际舟完成签到,获得积分10
17秒前
兴奋的定帮完成签到,获得积分10
17秒前
酷波er应助阿肯李采纳,获得10
18秒前
20秒前
again完成签到 ,获得积分10
20秒前
yangy115完成签到,获得积分10
20秒前
小桑桑发布了新的文献求助20
22秒前
孤独雨梅完成签到,获得积分10
22秒前
缓慢雅青完成签到 ,获得积分10
26秒前
昂叔的头发丝儿完成签到,获得积分10
26秒前
昵称完成签到,获得积分10
29秒前
30秒前
韶邑完成签到,获得积分10
30秒前
陈独秀完成签到,获得积分10
31秒前
34秒前
35秒前
坚定思枫完成签到 ,获得积分10
36秒前
早日发nature完成签到 ,获得积分10
37秒前
毛小毛发布了新的文献求助10
37秒前
朝歌完成签到,获得积分10
38秒前
高分求助中
좌파는 어떻게 좌파가 됐나:한국 급진노동운동의 형성과 궤적 2500
Sustainability in Tides Chemistry 1500
TM 5-855-1(Fundamentals of protective design for conventional weapons) 1000
Cognitive linguistics critical concepts in linguistics 800
Threaded Harmony: A Sustainable Approach to Fashion 799
Livre et militantisme : La Cité éditeur 1958-1967 500
氟盐冷却高温堆非能动余热排出性能及安全分析研究 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3052675
求助须知:如何正确求助?哪些是违规求助? 2709926
关于积分的说明 7418483
捐赠科研通 2354527
什么是DOI,文献DOI怎么找? 1246159
科研通“疑难数据库(出版商)”最低求助积分说明 605951
版权声明 595921