A Dynamic Hybrid Berth Allocation Problem with Routing Constraints in Bulk Ports: Data sets and results
datasetposted on 31.03.2020 by Hamza Bouzekri, Gülgün Alpan, Vincent Giard
Datasets usually provide raw data for analysis. This raw data often comes in spreadsheet form, but can be any collection of data, on which analysis can be performed.
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.