The Berth Allocation Problem with Channel Restrictions - Datasets

These datatasets relate to the computational study presented in the paper The Berth Allocation Problem with Channel Restrictions, authored by Paul Corry and Christian Bierwirth. They consist of all the randomly generated problem instances along with the computational results presented in the paper.

Results across all problem instances assume ship separation parameters of [delta_1, delta_2, delta_3] = [0.25, 0, 0.5].

Excel Workbook Organisation:

The data is organised into separate Excel files for each table in the paper, as indicated by the file description. Within each file, each row of data presented (aggregating 10 replications) in the corrsponding table is captured in two worksheets, one with the problem instance data, and the other with generated solution data obtained from several solution methods (described in the paper). For example, row 3 of Tab. 2, will have data for 10 problem instances on worksheet T2R3, and corresponding solution data on T2R3X.

Problem Instance Data Format:

On each problem instance worksheet (e.g. T2R3), each row of data corresponds to a different problem instance, and there are 10 replications on each worksheet.

The first column provides a replication identifier which is referenced on the corresponding solution worksheet (e.g. T2R3X).

Following this, there are n*(2c+1) columns (n = number of ships, c = number of channel segmenets) with headers p(i)_(j).(k)., where i references the operation (channel transit/berth visit) id, j references the ship id, and k references the index of the operation within the ship. All indexing starts at 0. These columns define the transit or dwell times on each segment. A value of -1 indicates a segment on which a berth allocation must be applied, and hence the dwell time is unkown.

There are then a further n columns with headers r(j), defining the release times of each ship.

For ChSP problems, there are a final n colums with headers b(j), defining the berth to be visited by each ship. ChSP problems with fixed berth sequencing enforced have an additional n columns with headers toa(j), indicating the order in which ship j sits within its berth sequence. For BAP-CR problems, these columnns are not present, but replaced by n*m columns (m = number of berths) with headers p(j).(b) defining the berth processing time of ship j if allocated to berth b.

Solution Data Format:

Each row of data corresponds to a different solution.

Column A references the replication identifier (from the corresponding instance worksheet) that the soluion refers to.

Column B defines the algorithm that was used to generate the solution.

Column C shows the objective function value (total waiting and excess handling time) obtained.

Column D shows the CPU time consumed in generating the solution, rounded to the nearest second.

Column E shows the optimality gap as a proportion. A value of -1 or an empty value indicates that optimality gap is unknown.

From column F onwards, there are are n*(2c+1) columns with the previously described p(i)_(j).(k). headers. The values in these columns define the entry times at each segment.

For BAP-CR problems only, following this there are a further 2n columns. For each ship j, there will be columns titled b(j) and p.b(j) defining the berth that was allocated to ship j, and the processing time on that berth respectively.

本数据集关联于由保罗·科里和克里斯蒂安·比耶尔维思撰写的论文《带通道限制的泊位分配问题》中呈现的计算研究。数据集包含了论文中展示的所有随机生成的实例及其计算结果。

所有问题实例的结果均假设船舶分离参数为[delta_1, delta_2, delta_3] = [0.25, 0, 0.5]。

Excel工作簿组织结构：

数据按照论文中表格的顺序组织在单独的Excel文件中，如文件描述所示。在每一个文件中，对应表格中呈现的每一行数据（汇总了10次重复）分别被记录在两个工作表中，一个包含问题实例数据，另一个包含通过多种解决方案方法（论文中有所描述）生成的解决方案数据。例如，第2表的第3行数据将在工作表T2R3中记录10个问题实例的数据，以及相应的解决方案数据在T2R3X中。

问题实例数据格式：

在每个问题实例工作表中（例如T2R3），每一行数据对应一个不同的问题实例，每个工作表中包含10个重复。

第一列提供了重复标识符，该标识符在相应的解决方案工作表中被引用（例如T2R3X）。

随后，有n*(2c+1)列（n = 船舶数量，c = 通道段数量）带有标题p(i)_(j).(k)，其中i指代操作（通道通行/泊位访问）ID，j指代船舶ID，k指代船舶内操作的索引。所有索引从0开始。这些列定义了每个段上的通行或停留时间。值为-1表示需要应用泊位分配的段，因此停留时间未知。

然后是n列带有标题r(j)的列，定义了每艘船舶的释放时间。

对于ChSP问题，最后有n列带有标题b(j)的列，定义了每艘船舶要访问的泊位。对于强制执行固定泊位排序的ChSP问题，还有额外的n列，带有标题toa(j)，指示船舶j在其泊位序列中的座位顺序。对于BAP-CR问题，这些列不存在，而是被n*m列（m = 泊位数量）取代，带有标题p(j).(b)，定义了如果船舶被分配到泊位b，船舶j在该泊位上的处理时间。

解决方案数据格式：

每一行数据对应一个不同的解决方案。

列A引用了重复标识符（来自相应实例工作表），该标识符对应解决方案。

列B定义了用于生成解决方案的算法。

列C显示了获得的目标函数值（总等待和超额处理时间）。

列D显示了生成解决方案所消耗的CPU时间，四舍五入到最接近的秒。

列E显示了最优性差距的比例。值为-1或空值表示最优性差距未知。

从列F开始，有n*(2c+1)列带有之前描述的p(i)_(j).(k)标题。这些列中的值定义了每个段上的进入时间。

对于BAP-CR问题仅，随后还有额外的2n列。对于每艘船舶j，将有标题为b(j)和p.b(j)的列，分别定义分配给船舶j的泊位和该泊位上的处理时间。