IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v194y2025ics1366554524005337.html
   My bibliography  Save this article

Joint berth and flexible storage space allocation in container tower ports

Author

Listed:
  • Zhen, Lu
  • Wang, Wencheng
  • Lin, Shumin
  • Yang, Linying
  • Jiang, Shenyan

Abstract

The increasing demand for container shipping has increased the difficulty of yard management and container processing time. High-density container tower ports are next-generation ports. They have advantages, such as stable steel frame structures, high yard land utilization rates, and eliminating the need for container reshuffling operations. This study investigates berth and storage space allocation in container tower ports by considering flexible storage strategies, container allocation, sub-tower size division, and sub-tower allocation. A mixed-integer programming model is proposed to characterize the problem. A column generation-based heuristic algorithm with high performance in terms of solving speed and quality is explored to solve this problem. Numerical experiments verify the performance of the proposed algorithm. Some management insights that can help ports operate efficiently are revealed.

Suggested Citation

  • Zhen, Lu & Wang, Wencheng & Lin, Shumin & Yang, Linying & Jiang, Shenyan, 2025. "Joint berth and flexible storage space allocation in container tower ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
    • Handle: RePEc:eee:transe:v:194:y:2025:i:c:s1366554524005337
    DOI: 10.1016/j.tre.2024.103942
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554524005337
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2024.103942?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.

    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:eee:transe:v:194:y:2025:i:c:s1366554524005337. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.