Benchmark results for VRP with Parcel Locker

Published: 18 August 2025| Version 1 | DOI: 10.17632/8xpyf25c7y.1
Contributors:
An Phú Châu,
, Bay Vo

Description

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.

Files

Institutions

  • Vietnam National University Ho Chi Minh City

Categories

Metaheuristics, Vehicle Routing Problem, Benchmarking

Licence