Optimization berth allocation in container terminals: A Pyomo and Google Colab approach

Efficient berth allocation profoundly influences container terminal operations, affecting vessel waiting and turnaround times, and overall performance. This study presents a mixed-integer linear programming (MILP) model addressing the Berth Allocation Problem (BAP) in a Malaysian container port. By incorporating the Pyomo optimization library and CBC (Coin-or Branch and Cut) solver in Google Colab, optimal berth allocations are determined, minimizing vessel turnaround times. Visualized in a Space-Time diagram, the results highlight efficient allocation strategies. Despite limitations, the study optimally resolved three instances, achieving a remarkable 38.54% reduction in overall vessel turnaround time compared to FCFS (First-Come-First-Serve) allocation. By prioritizing port turnaround time, the optimization substantially reduced berthing and departure delays, aligning with UNCTAD's call for enhanced port efficiency and accelerated decarbonization efforts.