A Dynamic Hybrid Berth Allocation Problem with Routing Constraints in Bulk Ports: Data sets and results

Published: 27 March 2020| Version 2 | DOI: 10.17632/bzmgbjttv3.2
Hamza Bouzekri,
Gülgün Alpan,
Vincent Giard


This data includes tests instances for a dynamic hybrid Berth Allocation Problem (BAP) with routing constraints (routes between storage hangars and berths) in a bulk port with multiple quays, different water depths, and heterogeneous loading equipment. These instances were generated based on a sample of data obtained from OCP group, a world leader in the phosphate industry. Computational results and Gantt charts are also provided.



Port Management