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

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.

本数据集包含了动态混合式泊位分配问题（BAP）的测试实例，该问题涉及路由约束（存储仓库与泊位之间的航线）在一个具有多个码头、不同水深和异构装卸设备的大宗货物港中。这些实例是基于全球磷肥行业领军企业OCP集团提供的数据样本生成的。同时，还提供了计算结果和甘特图。