Benchmark results for VRP with Parcel Locker

This datasets contains the computational benchmark of different methods on VRP with Parcel Locker (VRPPL). The methods used in this benchmark includes our proposed 3D-PACO, PACO (no 3D pheromone matrix), Simulated Annealing, Hybrid ACO and Tabu Search (ACO-TS), Adaptive Large Neighborhood Search (ALNS) and Harris Hawk Optimization (HHO). Methods are compared based on the number of best-known solutions found, average of objective value and average runtime (seconds). Each sheet in this dataset contains the benchmark on different dataset size (small, medium and large), with 56 instances each size.本数据集包含不同算法在带包裹驿站的车辆路径问题（Vehicle Routing Problem with Parcel Locker, VRPPL）上的计算基准测试结果。本次基准测试所采用的算法包括本研究提出的3D-PACO、不含三维信息素矩阵的PACO、模拟退火算法、混合蚁群优化算法、禁忌搜索（ACO-TS）、自适应大邻域搜索（ALNS）以及哈里斯鹰优化算法（HHO）。各算法的对比指标包括最优已知解的发现数量、目标函数平均值以及平均运行时长（单位：秒）。本数据集的每个工作表对应不同规模（小型、中型、大型）的基准测试场景，每种规模包含56个测试实例。