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

Berth allocation recovery for container transshipment terminals

Author

Listed:
  • Xiaohuan Lv
  • Jian Gang Jin
  • Hao Hu

Abstract

In container terminals, operators normally form an initial plan for berth allocation before the arrival of incoming vessels. However, during the real operations, unforeseen incidents (e.g. delays, equipment breakdowns) happen frequently, which hinder the implementation of initial plans. In response to disruptions, terminal operators usually employ an experience-based strategy for berth allocation recovery. However, this practice may not work well in challenging situations, especially when extensive transshipment operations need to be conducted, and the berthing for mother and feeder vessels should be coordinated. This paper studies the disruption recovery problem for berth allocation in transshipment terminals, and develops decision support tools for terminal operators. A mixed integer linear programming model is established to adjust original berthing plan with the objective of minimizing recovery cost caused by deviations from the original plan. Quay crane assignment decision is also taken into account during disruption recovery. Transshipment connections between correlated feeder and mother vessels are also considered specifically in order to reduce the missing of transshipment connection opportunities. Squeaky Wheel Optimization heuristic is devised to find near-optimal solutions under large problem scales. Extensive computational experiments validate the effectiveness and the efficiency of designed method, and the results show practical benefit from incorporating transshipment consideration when rescheduling berth allocation.

Suggested Citation

  • Xiaohuan Lv & Jian Gang Jin & Hao Hu, 2020. "Berth allocation recovery for container transshipment terminals," Maritime Policy & Management, Taylor & Francis Journals, vol. 47(4), pages 558-574, June.
  • Handle: RePEc:taf:marpmg:v:47:y:2020:i:4:p:558-574
    DOI: 10.1080/03088839.2020.1725672
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03088839.2020.1725672?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. Michael Görges & Michael Freitag, 2022. "Design and Evaluation of an Integrated Autonomous Control Method for Automobile Terminals," Logistics, MDPI, vol. 6(4), pages 1-27, October.
    2. Rodrigues, Filipe & Agra, Agostinho, 2022. "Berth allocation and quay crane assignment/scheduling problem under uncertainty: A survey," European Journal of Operational Research, Elsevier, vol. 303(2), pages 501-524.
    3. Cao, Zhen & Wang, Wenyuan & Jiang, Ying & Xu, Xinglu & Xu, Yunzhuo & Guo, Zijian, 2022. "Joint berth allocation and ship loader scheduling under the rotary loading mode in coal export terminals," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 229-260.
    4. Jaap-Jan Steeg & Menno Oudshoorn & Neil Yorke-Smith, 2023. "Berth planning and real-time disruption recovery: a simulation study for a tidal port," Flexible Services and Manufacturing Journal, Springer, vol. 35(1), pages 70-110, March.
    5. Meixian Jiang & Jiajia Feng & Jian Zhou & Lin Zhou & Fangzheng Ma & Guanghua Wu & Yuqiu Zhang, 2023. "Multi-Terminal Berth and Quay Crane Joint Scheduling in Container Ports Considering Carbon Cost," Sustainability, MDPI, vol. 15(6), pages 1-20, March.

    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:47:y:2020:i:4:p:558-574. 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.