Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays

Efficient management of port resources plays a crucial role in reducing vessel stay times and avoiding the payment of demurrage charges. In this paper, we focus on the integrated Laycan and Berth Allocation and Quay Crane Assignment Problem, which considers three main decision problems in port management in an integrated way: the Laycan Allocation Problem, the dynamic continuous Berth Allocation Problem and the time-invariant Quay Crane Assignment Problem. In a second part, the integrated problem is extended to the Specific Quay Crane Assignment, which includes the assignment of a set of specific quay cranes to each vessel, considering the productivity of quay cranes and their maximum outreach. The proposed integer programming models are original in several ways. First, the formulation of the models uses predicates which ensure flexibility in the implementation, and significantly improve the computational performance. The numerical study shows that the problems of practical size can be solved to optimality in a reasonable time using commercial software. Second, since the studied problems have different decision levels, a change of decision time-interval is incorporated inside the planning horizon for seamless decision-making. Third, to ensure that this integrated problem is as close as possible to reality, we consider both physical characteristics of the ports rarely studied together (tidal ports with multiple quays and different water depths) and contractual clauses (non-working periods and Charter Party clauses). The output of the models is an efficient schedule for berthing chartered vessels with an efficient quay crane assignment, and laycans to new vessels to charter.