Résumé (EN)

In this paper, we study the integrated Laycan and Berth Allocation Problem (LBAP) in the context of bulk ports, which considers two problems in an integrated way: the tactical Laycan Allocation Problem and the dynamic hybrid case of the operational Berth Allocation Problem. To make the LBAP closer to reality, we consider tidal bulk ports with conveyor routing constraints between storage hangars and berthing positions, preventive maintenance activities, multiple quays with different water depths and fixed heterogeneous bulk-handling cranes, navigation channel restrictions, vessels with multiple cargo types, charter party clauses and non-working periods. The aim of the proposed integer programming model is to define an efficient schedule for berthing chartered vessels and optimal laycans to new vessels to charter. The model is formulated with predicates that guarantee maximum flexibility in the implementation and greatly improve the computational performance. Finally, the model is tested and validated through a relevant case study inspired by the operations of OCP Group at the bulk port of Jorf Lasfar in Morocco. The results show that the model can be used to solve to optimality instances with up to 60 vessels for a 4-week planning horizon in very reasonable computational time using commercial software.