IDEAS home Printed from https://ideas.repec.org/a/taf/marpmg/v46y2019i2p201-216.html
   My bibliography  Save this article

Modelling and optimisation of online container stacking with operational constraints

Author

Listed:
  • Ceyhun Güven
  • Deniz Türsel Eliiyi

Abstract

Container transportation plays a critical role in the global shipping network and container terminals need to improve their operations to increase efficiency. Storage yard of a container terminal is a temporary area where the containers stay until they are shipped to their next destination. We concentrate on increasing the efficiency of the storage yard by developing online stacking policies for each incoming container. An unproductive move of a container, performed to reach another container stored underneath, is called reshuffling. The objective in container stacking problem is to minimise the number of reshuffles, thereby increasing the efficiency of terminal operations. Additional weight-related operational constraints bring additional complexity to the online stacking decisions. We propose a mathematical model for the optimal online assignment of an incoming export, transit, import or empty container. We also propose an optimal online stacking policy and compare it with a random policy through simulation. Additionally, lower bounds for the performance measures are obtained through simulation by relaxing the operational constraints of the problem in a third stacking policy. We present and discuss the computational results in terms of four main performance measures.

Suggested Citation

  • Ceyhun Güven & Deniz Türsel Eliiyi, 2019. "Modelling and optimisation of online container stacking with operational constraints," Maritime Policy & Management, Taylor & Francis Journals, vol. 46(2), pages 201-216, February.
    • Handle: RePEc:taf:marpmg:v:46:y:2019:i:2:p:201-216
    DOI: 10.1080/03088839.2018.1450529
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03088839.2018.1450529
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03088839.2018.1450529?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. Kastner, Marvin & Peters, Malte & Jahn, Carlos, 2021. "Assessing performance of container slot allocation heuristics," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Jahn, Carlos & Kersten, Wolfgang & Ringle, Christian M. (ed.), Adapting to the Future: Maritime and City Logistics in the Context of Digitalization and Sustainability. Proceedings of the Hamburg International Conf, volume 32, pages 427-454, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
    3. Hyun Ji Park & Sung Won Cho & Abhilasha Nanda & Jin Hyoung Park, 2023. "Data-driven dynamic stacking strategy for export containers in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 35(1), pages 170-195, March.
    4. Turkay Yildiz, 2019. "Design and Analysis of a Lightweight Composite Shipping Container Made of Carbon Fiber Laminates," Logistics, MDPI, vol. 3(3), pages 1-20, July.

    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:marpmg:v:46:y:2019:i:2:p:201-216. 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/TMPM20 .

    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.