Vehicle Routing Problem with Time Windows: Benchmark Instances and Best-Known Solutionsdoi:10.83693/DAPU-TEST.NRW/VHRCAMDataPublication.nrw2026-10-161FernUniversität in Hagen, Faculty of Mathematics and Computer Science, 2026, "Vehicle Routing Problem with Time Windows: Benchmark Instances and Best-Known Solutions", https://doi.org/10.83693/DAPU-TEST.NRW/VHRCAM, DataPublication.nrw, V1Vehicle Routing Problem with Time Windows: Benchmark Instances and Best-Known Solutionsdoi:10.83693/DAPU-TEST.NRW/VHRCAMFernUniversität in Hagen, Faculty of Mathematics and Computer ScienceDataPublication.nrwDataPublication.nrw TeamFernUniversität in HagenComputer and Information ScienceMathematical SciencesComputer and Information ScienceMathematical Sciencescombinatorial optimizationvehicle routingbenchmarkDaPu demoInstance characteristics and best-known solution costs for a set of capacitated vehicle routing benchmarks with time windows. Suitable for comparing exact and heuristic solvers. Synthetic example dataset created by the DataPublication.nrw team for demonstration purposes. All values are generated and do not describe real persons, organisations or events.<a href="http://creativecommons.org/publicdomain/zero/1.0">CC0 1.0</a>histogram_customers.pngHistogram of column customersimage/pngREADME.mdDataset and column documentationtext/markdownvrptw_instances.csvData table, 200 rowstext/csv