Test Problems' Data Sets

The first Sheet: Test problem data This data sets were generated as the test problems for evaluating the performance of the proposed mixed-integer programming model as well as the Genetic Algorithm hybridized with variable neighborhood search. The first, second and third columns show the problem number, the station number and the stations' demands in bins, respectively. The second sheet: GA-VNS best solution The details for the best-found solutions obtained by GA-VNS are reported. The first three columns show the problem characteristics. The columns numbered 1-30 the details of the solutions including the supermarket assignment (the first row) and the transport vehicle assignment (the second row) for each problem solved are reported. The results of the calculation for each term of the considered objective function are provided under the rest of columns. For this considered problem the number of supermarkets (NS), total distance for feeding stations from supermarkets (distance), total installation cost of supermarkets (TIC), total vehicle procurement cost (TVPS), total shipment cost (TSC) and total cost (TC) are reported, respectively.

第一个工作表：测试问题数据。本数据集用于生成测试问题，以评估所提出的混合整数规划模型（mixed-integer programming model）以及结合变邻域搜索的遗传算法（Genetic Algorithm hybridized with variable neighborhood search）的性能。数据集的前三列依次为问题编号、站点编号与站点的箱装需求量。
第二个工作表：GA-VNS最优解。本工作表报告了通过GA-VNS获得的当前最优解详情。前三列为问题特征，第1至30列则给出了各已求解问题的解详情，包括超市分配方案（第一行）与运输车辆分配方案（第二行）。其余列则提供了所考量的目标函数各分项的计算结果。针对本数据集所涉问题，依次报告了超市数量（NS）、超市向站点配送的总行驶距离（distance）、超市总安装成本（TIC）、车辆总采购成本（TVPS）、总运输成本（TSC）以及总成本（TC）。