CVRPLib large instances
Shorter routes on large capacitated vehicle routing instances within a fixed CPU budget (placeholder)
State the benchmark (placeholder)
Browse files+11 −0 README.md added View file
| @@ -0,0 +1,11 @@ | ||
| 1 | +# CVRPLib large instances | |
| 2 | + | |
| 3 | +> **Placeholder.** This benchmark is here so the benchmark panel can be tried out. Its baseline is from the blueprint or the literature as of 2026-10-19 and must be checked again; every route and score after it is made up. | |
| 4 | + | |
| 5 | +## Task | |
| 6 | + | |
| 7 | +Solve large capacitated vehicle routing instances from CVRPLib, the X set and the Belgian instances of Arnold, Gendreau and Sörensen, within a fixed CPU budget, starting from the open-source HGS-CVRP solver. The score is the mean gap to the best known solutions, in percent; the verifier checks every route for capacity and that each customer is served once. | |
| 8 | + | |
| 9 | +## How to take part | |
| 10 | + | |
| 11 | +Start a route from `main` (the baseline) or from any route on the leaderboard, keep your files in the route's folder, and push: the verifier scores every commit. Say what your route changes with tags, and keep the misses: a route that scores worse is a result too. | |