All datasets tasks Vehicle routing with time windows Solomon VRPTW benchmark instances Solomon's 1983 vehicle routing instances with time windows (C1, C2, R1, R2, RC1, RC2), each with 100 customers.
npx keepset fetch lcc-malaga-solomon-vrptw-benchmark
Instances 56
Size 80 KiB Fetch and preview this dataset on this page, or download the result as JSON. The command line fetches it without a browser.
Overview Sources and provenance Citations M. M. Solomon (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2), 254-265. doi:10.1287/opre.35.2.254 Recipe Source #1 Archive zip Members ending .txt Parser format "solomon"Parser encoding "utf-8"
Crosswalk solomon to tasks/v1, as a crossmap crosswalk.
Rule From To Direction move metametaboth move nodes[].idnodes[].idboth move nodes[].duenodes[].deadlineboth move nodes[].xnodes[].xboth move nodes[].ynodes[].yboth move nodes[].demandnodes[].demandboth move nodes[].readynodes[].readyboth move nodes[].servicenodes[].serviceboth
Expected counts Properties Download bytes 80 KiB Survey id or-5 Time unit abstract units