Column Generation Limits for the Dynamic Berth Allocation Problem (Resubmission)

The Dynamic Berth Allocation Problem (DBAP) is crucial in maritime logistics and port management, involving the efficient assignment of berths to arriving ships at a port. This study investigates DBAP using a column generation methodology, demonstrating its effectiveness in solving the problem. The proposed approach establishes new lower bounds for instances unsolved in the literature and produces results in a significantly shorter time compared to the time-indexed model. Specifically, column generation identified three new lower bounds for these instances and matched the best known value in 76.4% of the remaining instances.  Column generation emerges as a promising methodology for future resolutions, as evidenced by the results.