IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v314y2024i2p630-646.html
   My bibliography  Save this article

Automated storage and retrieval system design with variant lane depths

Author

Listed:
  • Dong, Wenquan
  • Jin, Mingzhou

Abstract

This paper models a warehouse design problem with 2D automated storage and retrieval system (AS/RS) and 3D AS/RS as options, where 3D racks may have different depths. The design problem is first modeled as a mixed-integer nonlinear program to minimize investment and maximize throughput under various business needs, such as cost structure, responsiveness requirement, demand rates, and inventory levels. The model is then converted to a mixed-integer program based on optimality conditions. A basic Branch-and-Bound algorithm and a modified one are developed to overcome computational challenges. A high throughput expectation leads to a design with shallow storage racks, while high land/equipment costs have opposite impacts. When demand rates are similar across SKUs, heterogeneously distributed inventory levels lead to racks with different depths and assigning SKUs with higher inventory levels to deeper racks. More heterogeneous demand rates also make rack depths more variant and have SKUs with higher demand rates assigned to shallower racks. In other words, the heterogeneities of inventory levels and demand rates have a contradictory effect on the SKU-to-rack assignment and result in racks with more uniform depths when SKUs with high demand also have high inventory levels, which is often the case in practice.

Suggested Citation

  • Dong, Wenquan & Jin, Mingzhou, 2024. "Automated storage and retrieval system design with variant lane depths," European Journal of Operational Research, Elsevier, vol. 314(2), pages 630-646.
  • Handle: RePEc:eee:ejores:v:314:y:2024:i:2:p:630-646
    DOI: 10.1016/j.ejor.2023.10.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723007634
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2023.10.006?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.

    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:eee:ejores:v:314:y:2024:i:2:p:630-646. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.