New benchmark instances for the Cross-Dock Door Assignment Problem

New benchmark instances for the Cross-Dock Door Assignment Problem (CDAP), with instances from 8 origins and destinations and 4 inbound and outbound doors up to 50 origins and destinations and 30 inbound and outbound doors. The instances have been obtained following the criteria of the paper by Nassief et al. (2016). First of all, the number of pallets to be moved from a supplier to a customer is randomly generated by using a uniform distribution U[10, 50] until reaching density values set to 25, 35, 50, and 75%. Each inbound truck sends pallets at least to one outgoing truck and each outgoing truck receives pallets from at least one incoming truck. The distance matrix is generated with numbers from the interval [8, 8 + |I|- 1], meaning that a direct distance between two doors is equal to 8, and then an increment of 1 unit is added for the next indirect door. The number of considered incoming/outgoing trucks is 8, 9, 10, 11, 12, 15, 20, and 50. The number of considered inbound/outbound doors is 4, 5, 6, 7, 10, and 30. The door capacities are equal for each instance and calculated by dividing the total flow coming from all origins by the total number of inbound doors, and then adding a capacity slackness of 5, 10, 15, 20, and 30%. To generate this set of instances, we have considered the combinations of values reported in the paper by Sayed (2020). The instances are referred to as 00×00×00x00 (number of the incoming and outgoing trucks x number of inbound and outbound doors x capacity slackness associated with the inbound/outbound doors - 5, 10, 15, 20, and 30% - x density of the flow matrix - 25, 35, 50, and 75%).本数据集为交叉码头门分配问题（Cross-Dock Door Assignment Problem, CDAP）提供了全新的测试用例，实例的起讫点数量覆盖8至50个，入/出口门数量覆盖4至30个。所有实例均遵循Nassief等人2016年发表论文中的标准生成。 从供应商运往客户的待运输托盘数量通过均匀分布U[10, 50]随机生成，直至流量密度分别达到25%、35%、50%与75%。要求每辆入港卡车至少为一辆出港卡车配送托盘，且每辆出港卡车至少接收一辆入港卡车的托盘。 距离矩阵的数值取自区间[8, 8+|I|-1]，即两门之间的直接距离为8，每增加一个间接中转门则递增1个单位。 本次测试涵盖的入/出港卡车数量为8、9、10、11、12、15、20与50；入/出口门数量则为4、5、6、7、10与30。 所有实例的门容量统一采用如下计算方式：将所有起点的总流量除以入港门总数，再分别附加5%、10%、15%、20%与30%的容量裕度。 本数据集的实例组合参考了Sayed（2020）发表论文中报告的参数组合。 测试用例的命名格式为00×00×00×00，各字段依次为：入/出港卡车数量 × 入/出口门数量 × 入/出口门容量裕度（分别对应5%、10%、15%、20%、30%） × 流量矩阵密度（分别对应25%、35%、50%、75%）。