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

Logistics optimisation of slab pre-marshalling problem in steel industry

Author

Listed:
  • Peixin Ge
  • Ying Meng
  • Jiyin Liu
  • Lixin Tang
  • Ren Zhao

Abstract

We study the slab pre-marshalling problem to re-position slabs in a way that the slabs are stored in the least number of stacks and each stack contains only the slabs of the same group, which can be utilised interchangeably. In this way, when a slab of any group is required, the topmost slab can always be picked up without shuffling. During pre-marshalling, however, at most two slabs can be moved by one operation. In this paper, we present a network model with three valid inequalities to solve this problem. With a small amount of labelled data from the model approach, a self-training technique is applied to train a function for predicting the best next move. Then, a new hybrid algorithm is developed to solve the practical problems by combining the self-training technique, heuristics, and the branch-and-bound algorithm with five dominance rules. The experimental results demonstrate the effectiveness of this network model and valid inequalities, and the performances of different components of this algorithm. The new algorithm produces high-quality solutions within seconds.

Suggested Citation

  • Peixin Ge & Ying Meng & Jiyin Liu & Lixin Tang & Ren Zhao, 2020. "Logistics optimisation of slab pre-marshalling problem in steel industry," International Journal of Production Research, Taylor & Francis Journals, vol. 58(13), pages 4050-4070, July.
  • Handle: RePEc:taf:tprsxx:v:58:y:2020:i:13:p:4050-4070
    DOI: 10.1080/00207543.2019.1641238
    as

    Download full text from publisher

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

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Parreño-Torres, Consuelo & Alvarez-Valdes, Ramon & Parreño, Francisco, 2022. "A beam search algorithm for minimizing crane times in premarshalling problems," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1063-1078.
    2. Pfrommer, Jakob & Meyer, Anne & Tierney, Kevin, 2024. "Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions," European Journal of Operational Research, Elsevier, vol. 313(3), pages 1054-1071.

    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:58:y:2020:i:13:p:4050-4070. 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.