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

Author:

Raviv Tal1ORCID,Bukchin Yossi1ORCID,de Koster René2ORCID

Affiliation:

1. Department of Industrial Engineering, Tel Aviv University, Tel Aviv 69978, Israel;

2. Department of Technology and Operations Management, Rotterdam School of Management, Erasmus University Rotterdam, 3062 PA Rotterdam, Netherlands

Abstract

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.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Transportation,Civil and Structural Engineering

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Travel time models for compact automated parking systems using two I/O points and the point of service completion dwell point policy;Transportation Research Part E: Logistics and Transportation Review;2024-09

2. The Algorithms for Managing a Matrix-Based Warehouse Utilizing Standardized Transport and Storage Cells;Vestnik NSU. Series: Information Technologies;2024-03-22

3. Model-Based System Engineering Approach to Design Customized Puzzle-Based Movable Rack Systems;IFIP Advances in Information and Communication Technology;2024

4. On Analysis of Puzzle-Based Warehouse Systems Using Modular Petri Nets;2023 34th Conference of Open Innovations Association (FRUCT);2023-11-15

5. Optimal Class-Based Storage System with Diagonal Movements;IFIP Advances in Information and Communication Technology;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3