IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i2p549-568.html
   My bibliography  Save this article

How to benefit from order data: correlated dispersed storage assignment in robotic warehouses

Author

Listed:
  • Masoud Mirzaei
  • Nima Zaerpour
  • René B.M. de Koster

Abstract

In e-commerce fulfilment centres, storage assignment is critical to ensure short response times. To achieve this, many online retailers have moved to product dispersion in combination with product turnover-based slotting. However, commonly used policies do not fully utilise the historical customer demand information to optimise the storage assignment. This paper addresses a comprehensive approach to estimate the joint effects of ‘turnover frequency’, ‘product correlation’, and ‘inventory dispersion’ storage strategies on the expected order picking travel time in automated (robotic), parts-to-picker systems. Additionally, it provides a thorough analysis of the impact of product correlation and turnover frequency on storage policies’ performance. We develop a mixed-integer linear program for optimal product-to-cluster and cluster-to-zone allocation to minimise the robot's expected travel time. The travel time expressions are developed for different zone and station configurations. An efficient construction and improvement heuristic method is proposed and applied to a real dataset of a personal care products distributor. The analytical results show that the correlated dispersed assignment leads to a shorter expected travel time than the benchmark policies for order sets with sufficiently large order size. The demand correlation plays a major role in the performance of the models in the cases we tested.

Suggested Citation

  • Masoud Mirzaei & Nima Zaerpour & René B.M. de Koster, 2022. "How to benefit from order data: correlated dispersed storage assignment in robotic warehouses," International Journal of Production Research, Taylor & Francis Journals, vol. 60(2), pages 549-568, January.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:2:p:549-568
    DOI: 10.1080/00207543.2021.1971787
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1971787
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2021.1971787?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:60:y:2022:i:2:p:549-568. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.