Data for: Recoverable robustness in weekly berth and quay crane planning
收藏官方服务：
资源简介：
Data for a weekly berth and quay crane planning problem
应用场景：
创建时间：
2019-03-14
相关数据集
Berth Allocation Problem - Simulation of Instances
This dataset gives the macro for generating different instances of the berth allocation problem. The parameters for generation are given in sheet 'DataForSim' and the output is given in the sheet 'Inp
NIAID Data Ecosystem60
A MATHEMATICAL MODEL AND SOLUTION METHOD FOR THE BERTH ALLOCATION PROBLEM WITH VARIABLE HANDLING TIME AND CONTINUOUS TIME HORIZON
ABSTRACT In this paper, we present the integration of two problems related to the operations in a port terminal: the Berth Allocation Problem (BAP) integrated with the Machine Assignment Problem. We p
Figshare2022-11-01 更新50
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, differen
Mendeley Data2020-03-27 更新30
Dataset for the Berth Allocation Problem with Inventory Control
This dataset contains instance files for the Berth Allocation Problem with Inventory Control. The instances are intended for benchmarking optimization and reinforcement learning approaches in berth al
Zenodo2026-04-04 更新50
Instances for the Berth Allocation Problem in Tidal Bulk ports with Inventory control (BAPTBI)
Set of problem instances in the format: instancia.nnN.bbB.ppP.dddD where nn= number of ships, bb = number of berths, pp = number of raw matters, ddd = density of raw matter per ship (25% = only one
Mendeley Data30
