Analysis of Berth Allocation Problems of Mainline and Feeder Vessels due to Ship Delays
Download PDF
$currentUrl="http://$_SERVER[HTTP_HOST]$_SERVER[REQUEST_URI]"

Keywords

Port management
Berth allocation
Mainline and feeder vessels
Ship delay

DOI

10.26689/ssr.v5i10.5447

Submitted : 2024-02-06
Accepted : 2024-02-21
Published : 2024-03-07

Abstract

With the development of the shipping industry, port terminals are becoming increasingly busy. As an essential
resource at the front of the terminal, berths are responsible for connecting the seaside and landside of the port. The efficiency of loading and unloading operations depends very much on the berth allocation. However, due to certain events such as weather factors and ship failures, ships are often delayed in arriving at the port, which severely impacts the berth allocation plan. To effectively deal with the effects of ship delay on the berth allocation plan, this paper studies the berth allocation problem of mainline and feeder vessels, considering the impact of uncertainty.

References

Park Y-M, Kim KH, 2003, A Scheduling Method for Berth and Quay Cranes. OR Spectrum, 25(1): 1–23.

Han X, Zhao S, 2014, Constraint Programming Model for Berth Allocation Problem Under Time Window Constraints. Journal of Liaoning University of Engineering and Technology (Natural Science Edition), 2014(07): 983–987.

Xie F, Wu T, Zhang C, 2019, A Branch-and-Price Algorithm for the Integrated Berth Allocation and Quay Crane Assignment Problem. Transportation Science, 53(5): 1427–1454.

Zeng Q, Feng Y, Du P, 2016, Container Terminal Berth Allocation Model for Trunk and Branch Line Ship Connection. Systems Engineering Theory and Practice, 36(01): 154–163.

Zeng Q, Zhang Q, 2009, Simulation Optimization Model and Algorithm for Container Berth Allocation Interference Management. China Science and Technology Papers Online, 2009(10): 742–746.

Zeng Q, Hu X, Yang Z, 2010, Container Terminal Berth Allocation-Loading Bridge Scheduling Interference Management Model. Systems Engineering Theory and Practice, 2010(11): 2026–2035.