IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v57y2023i2p424-443.html
   My bibliography  Save this article

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

Author

Listed:
  • Tal Raviv

    (Department of Industrial Engineering, Tel Aviv University, Tel Aviv 69978, Israel)

  • Yossi Bukchin

    (Department of Industrial Engineering, Tel Aviv University, Tel Aviv 69978, Israel)

  • René de Koster

    (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.

Suggested Citation

  • Tal Raviv & Yossi Bukchin & René de Koster, 2023. "Optimal Retrieval in Puzzle-Based Storage Systems Using Automated Mobile Robots," Transportation Science, INFORMS, vol. 57(2), pages 424-443, March.
  • Handle: RePEc:inm:ortrsc:v:57:y:2023:i:2:p:424-443
    DOI: 10.1287/trsc.2022.1169
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2022.1169
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2022.1169?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:57:y:2023:i:2:p:424-443. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.