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

被引:4
|
作者
Raviv, Tal [1 ]
Bukchin, Yossi [1 ]
de Koster, Rene [2 ]
机构
[1] Tel Aviv Univ, Dept Ind Engn, IL-69978 Tel Aviv, Israel
[2] Erasmus Univ, Rotterdam Sch Management, Dept Technol & Operat Management, Rotterdam, Netherlands
关键词
puzzle-based storage; retrieval scheduling; autonomous vehicles; SINGLE-ITEM;
D O I
10.1287/trsc.2022.1169
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:424 / 443
页数:21
相关论文
共 50 条
  • [1] Retrieval time performance in puzzle-based storage systems
    Kota, Venkat R.
    Taylor, Don
    Gue, Kevin R.
    JOURNAL OF MANUFACTURING TECHNOLOGY MANAGEMENT, 2015, 26 (04) : 582 - 602
  • [2] Optimal retrieval in puzzle-based storage with heuristic search and tabulation
    Rosenfeld, Ariel
    NETWORKS, 2022, 79 (03) : 390 - 402
  • [3] Puzzle-based storage systems
    Gue, Kevin R.
    Kim, Byung Soo
    NAVAL RESEARCH LOGISTICS, 2007, 54 (05) : 556 - 567
  • [4] A comprehensive toolbox for load retrieval in puzzle-based storage systems with simultaneous movements
    Bukchin, Yossi
    Raviv, Tal
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2022, 166 : 348 - 373
  • [5] An optimal and a heuristic algorithm for the single-item retrieval problem in puzzle-based storage systems with multiple escorts
    Yalcin, Altan
    Koberstein, Achim
    Schocke, Kai-Oliver
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2019, 57 (01) : 143 - 165
  • [6] Heuristics for puzzle-based storage systems driven by a limited set of automated guided vehicles
    A. Alfieri
    M. Cantamessa
    A. Monchiero
    F. Montagna
    Journal of Intelligent Manufacturing, 2012, 23 : 1695 - 1705
  • [7] Heuristics for puzzle-based storage systems driven by a limited set of automated guided vehicles
    Alfieri, A.
    Cantamessa, M.
    Monchiero, A.
    Montagna, F.
    JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23 (05) : 1695 - 1705
  • [8] Modelling load retrievals in puzzle-based storage systems
    Mirzaei, Masoud
    De Koster, Rene B. M.
    Zaerpour, Nima
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (21) : 6423 - 6435
  • [9] Determining Optimal Zone Boundaries for Three-Class-Based Puzzle-Based Compact Storage Systems
    Zhang, Linda L.
    Yu, Yugang
    Zhang, Li
    2013 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM 2013), 2013, : 361 - 366
  • [10] Reinforcement learning for multi-item retrieval in the puzzle-based storage system
    He, Jing
    Liu, Xinglu
    Duan, Qiyao
    Chan, Wai Kin Victor
    Qi, Mingyao
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 305 (02) : 820 - 837