Instances and results for Locker box location planning under uncertainty in demand and capacity availability

This folder containts 20 datasets for the problem "Locker box location planning under uncertainty in demand and capacity availability". It also contains two result files: (i) "results" which reports results obtained by the mathematical model with a timelimit of 3600 seconds. Instances for which the computational time is <3600 sec are solved to the optimality and the reported solution value is optimal (ii) "results heuristic" which report best solutions obtained by our matheuristics

本文件夹包含适用于「需求与容量可用性存在不确定性下的储物柜点位规划」问题的20个数据集。此外还包含两份结果文件：(i) 「results」文件，记录了数学模型在3600秒求解时限下的计算结果。若算例的计算耗时小于3600秒，则该算例已求解至最优，报告的解值为全局最优解；(ii) 「results heuristic」文件，记录了我们提出的数学启发式算法得到的最优求解结果。