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

Within-aisle or across-aisle? Optimisation and comparison of two class-based storage policies in multi-dock unit-load warehouses

Author

Listed:
  • Bilin Yu
  • Hu Yu
  • Yugang Yu

Abstract

As E-Commerce develop, customers' tight delivery requirements are driving warehouses to operate more efficiently. This paper studies two types of class-based storage policies for a multi-dock unit-load warehouse: the within-aisle policy and the across-aisle policy. The aim is to determine the optimal class boundary and explore the dominance situation (i.e. which policy performs better in which situation). We first develop an expected response distance model for each policy based on a general layout of multiple docks. Then, closed-form optimal first zone boundary and warehouse dimension are given for the across-aisle policy. For within-aisle policy, an efficient algorithm is developed (based on the proved unimodality property) for obtaining its optimal first zone boundary. Besides, each policy's dominance situation is analysed for two typical situations. Numerical results show that both policies can bring up to 60% performance improvement compared with the random storage policy. Impacts of docks layout and warehouse dimensions on each policy's dominance situations are illustrated. It shows that the across-aisle policy performs better in the situation where the docks' and wall's centrelines are adjacent, and in the situation where the warehouse is narrow and deep. Managerial insights on policy selection and dock layout design are presented for warehouse managers.

Suggested Citation

  • Bilin Yu & Hu Yu & Yugang Yu, 2022. "Within-aisle or across-aisle? Optimisation and comparison of two class-based storage policies in multi-dock unit-load warehouses," International Journal of Production Research, Taylor & Francis Journals, vol. 60(8), pages 2572-2597, April.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:8:p:2572-2597
    DOI: 10.1080/00207543.2021.1898060
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2021.1898060?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:8:p:2572-2597. 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.