IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v56y2018i1-2p60-71.html
   My bibliography  Save this article

On the quality of simple measures predicting block relocations in container yards

Author

Listed:
  • Joachim Scholl
  • David Boywitz
  • Nils Boysen

Abstract

The blocks relocation problem aims to minimise the number of unproductive relocation moves where blocking containers have to be removed to other stacks when retrieving containers in a given sequence from a container yard. Sometimes there is not enough time to solve this complex optimisation problem and information on the crane performance, which mainly depends on the relocation effort, is required under great time pressure. In this case, simple measures are required, which are quickly computed and, nonetheless, accurately predict the amount of relocation moves. This paper is dedicated to comparing twelve different known and new measures. Our computational study shows that composite measures combining a lower bound argument with a simple rule-based upper bound lead to predictions of remarkable accuracy.

Suggested Citation

  • Joachim Scholl & David Boywitz & Nils Boysen, 2018. "On the quality of simple measures predicting block relocations in container yards," International Journal of Production Research, Taylor & Francis Journals, vol. 56(1-2), pages 60-71, January.
    • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:1-2:p:60-71
    DOI: 10.1080/00207543.2017.1394595
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1394595
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2017.1394595?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. Boschma, René & Mes, Martijn R.K. & de Vries, Leon R., 2023. "Approximate dynamic programming for container stacking," European Journal of Operational Research, Elsevier, vol. 310(1), pages 328-342.
    2. Zweers, Bernard G. & Bhulai, Sandjai & van der Mei, Rob D., 2020. "Optimizing pre-processing and relocation moves in the Stochastic Container Relocation Problem," European Journal of Operational Research, Elsevier, vol. 283(3), pages 954-971.

    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:56:y:2018:i:1-2:p:60-71. 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.