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

Travel time model for multi-deep automated storage and retrieval systems with different storage strategies

Author

Listed:
  • Timo Lehmann
  • Jakob Hußmann

Abstract

Travel time models for automated storage and retrieval systems (AS/RS) are used to define average travel times during storage/retrieval operations in an AS/RS. With an increasing depth of AS/RS racks, storage goods are stored in front of each other. This can lead to relocation operations of blocking goods causing higher travel times. This paper derives analytically and presents four travel time models for multi-deep AS/RS following four storage allocation strategies. Two models handle random strategies, one minimises the variance of storage channel fillings and the fourth maximises this variance. Evaluation and comparison of different models is followed by a discrete event simulation to verify these models. It is shown that the minimal variance strategy achieves the lowest relocation numbers and also the lowest total travel times, the random strategies perform between the minimal and maximal variance strategy.

Suggested Citation

  • Timo Lehmann & Jakob Hußmann, 2023. "Travel time model for multi-deep automated storage and retrieval systems with different storage strategies," International Journal of Production Research, Taylor & Francis Journals, vol. 61(16), pages 5676-5691, August.
    • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:16:p:5676-5691
    DOI: 10.1080/00207543.2022.2110536
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2110536
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2022.2110536?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:61:y:2023:i:16:p:5676-5691. 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.