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

Integrated optimisation of storage and pre-marshalling moves in a slab warehouse

Author

Listed:
  • Peixin Ge
  • Ren Zhao
  • Defeng Sun
  • Yun Dong

Abstract

In the slab warehouses of iron and steel enterprises, the slabs are stacked on top of others. Thus, some slabs will be blocked by others from being retrieved directly. In this study, we focus on optimising slab storage and pre-marshalling moves in advance so as to minimise the numbers of slabs which may block retrieval slab, the number of stacks occupied by slabs, and the number of required moves. We also address the practical concern of moving no more than two slabs together. To solve this problem, we present an integer linear programming model and further propose valid inequalities to enhance the model. Based on the labelled data from this modelling approach, a self-training technique is applied to train two functions which can predict the optimal following pre-marshalling move and storage move. By combining these functions, heuristics and branch-and-bound algorithm with the dominance rules, a multi-stage hybrid algorithm is proposed to solve practical problems. The experimental results show the effectiveness of the model, the valid inequalities, and the different components of hybrid algorithm which can produce high-quality solutions within seconds.

Suggested Citation

  • Peixin Ge & Ren Zhao & Defeng Sun & Yun Dong, 2022. "Integrated optimisation of storage and pre-marshalling moves in a slab warehouse," International Journal of Production Research, Taylor & Francis Journals, vol. 60(6), pages 2021-2043, March.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:6:p:2021-2043
    DOI: 10.1080/00207543.2021.1883760
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2021.1883760?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:6:p:2021-2043. 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.