2026-10-14T01:44:38Z https://data.mendeley.com/oai

oai:data.mendeley.com/8xpyf25c7y.1 2025-08-18T19:17:30Z

Châu, An Phú Benchmark results for VRP with Parcel Locker Mendeley Data 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. Metaheuristics Vehicle Routing Problem Benchmarking Nguyen, Loan Vo, Bay Dataset doi:10.17632/8xpyf25c7y.1 oai:data.mendeley.com/8xpyf25c7y.1 Creative Commons Attribution 4.0 International http://creativecommons.org/licenses/by/4.0 https://data.mendeley.com/datasets/8xpyf25c7y 2025-08-18T19:17:30Z