Skip to content

Dabia2013 (TDVRP)

The TDVRP layer of Dabia2013 is the same benchmark material with the time windows removed: same Solomon-derived customers, demands, capacities, service times, and the same canonical IGP arrival-time functions (the ATF sidecars are time-window-independent and therefore shared bit-for-bit with the TDVRPTW layer). The objective remains Duration minimization with per-route dispatch-time optimization under the canonical checker contract.

Dropping the time windows isolates the time-dependent routing core of the problem: solvers face the same time-varying travel times without the pruning power that tight Solomon time windows provide, which changes both heuristic and exact-method behavior (typically longer routes and much larger feasible neighborhoods). No historic solutions exist for this variant; all BKS were produced by KAYROS heuristic runs on Grid5000 and are heuristic references, not optimality certificates.

Licensing note: as for the TDVRPTW layer, MAMUT-authored curation artifacts are under the MIT License, while underlying third-party benchmark definitions are not relicensed.

The family currently contains 168 instances over 3 sizes, each with a Duration BKS.

Data

Instances and best-known solutions: /benchmarks/tdvrp/dabia2013/ on the website. Repository: https://github.com/ANR-MAMUT/MAMUT-routing/tree/main/benchmarks/TDVRP/Dabia2013.

Repository README

Dabia2013 TDVRP benchmark family (TW-free variant)

Duration-Minimization TDVRP variant of the TDVRPTW Dabia2013 family: the exact same instances with time windows removed (service times, demands, capacity, fleet size and time-dependent travel times unchanged; the depot departure time remains a decision variable).

Artifacts are deliberately duplicated from the TDVRPTW family so each problem-family release stays self-contained: .vrp.json files simply omit time_windows, and the .atf.json[.gz] sidecars are byte-identical to their TDVRPTW counterparts (same sha256). See the TDVRPTW family README for format, conventions, provenance and licensing.

Every instance carries a Duration BKS. The published Dabia2013 solutions are TDVRPTW solutions, so no historic TW-free solutions existed for this variant; all BKS come from KAYROS heuristic runs on Grid5000 (see the CHANGELOG) and are heuristic references, not optimality certificates.