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

The clustering strategy for stacks allocation in automated container terminals

Author

Listed:
  • Hang Yu
  • Mingzhong Huang
  • Junliang He
  • Caimao Tan

Abstract

The heavy congestion at the global ports and the impact of the pandemic spread make the automated container terminal competitive. With the operations of more and more automated container terminals, the optimization of yard space allocation becomes one of the most urgent issues for improving the handling efficiency for the automated container terminal. To figure out the optimal clustering strategy to allocate the containers in the automated container terminal, this study investigates the stacks allocation with different scenarios. A novel stack-based allocation model is built to balance both the transportation distance and the allocation dispersion among blocks. Based on the model we built, we talked about the impact of efficiency of automated rail-mounted gantry crane and the berthing time for each vessel on the stacks allocation. The results show that the stack-based allocation with multi-batches in the same bay is suitable for the automated container terminal, while both the efficiency of the automated rail-mounted gantry crane and the berthing time will directly affect the total transportation distance for allocating the containers. The research is very inspiring for the terminal manager to choose the suitable clustering strategy and improve the yard space management for the automated container terminal.

Suggested Citation

  • Hang Yu & Mingzhong Huang & Junliang He & Caimao Tan, 2023. "The clustering strategy for stacks allocation in automated container terminals," Maritime Policy & Management, Taylor & Francis Journals, vol. 50(8), pages 1102-1117, November.
  • Handle: RePEc:taf:marpmg:v:50:y:2023:i:8:p:1102-1117
    DOI: 10.1080/03088839.2022.2119616
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03088839.2022.2119616?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:marpmg:v:50:y:2023:i:8:p:1102-1117. 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.