CVRPLib large instances
Shorter routes on large capacitated vehicle routing instances within a fixed CPU budget (placeholder)
Declare the evaluation and the baseline
浏览文件+37 −0 scienceslack.json 新增 查看文件
| @@ -0,0 +1,37 @@ | ||
| 1 | +{ | |
| 2 | + "domain": "computer-science", | |
| 3 | + "image": "python:3.12-slim", | |
| 4 | + "data": "The instances and their best known solutions are in instances/, from CVRPLib as of 2026-10-19.", | |
| 5 | + "benchmark": { | |
| 6 | + "task": "Vehicle routing", | |
| 7 | + "metric": { | |
| 8 | + "name": "gap to best known, %", | |
| 9 | + "better": "lower" | |
| 10 | + }, | |
| 11 | + "cost": "CPU-minutes", | |
| 12 | + "subtasks": "instances", | |
| 13 | + "guardrails": [ | |
| 14 | + "Every customer is served exactly once and no vehicle exceeds its capacity", | |
| 15 | + "At most 240 CPU-minutes per instance on the reference runner", | |
| 16 | + "No best known solution is read during the search" | |
| 17 | + ], | |
| 18 | + "aggregate": "mean", | |
| 19 | + "baseline": { | |
| 20 | + "name": "HGS-CVRP", | |
| 21 | + "score": 1.42, | |
| 22 | + "cost": 120, | |
| 23 | + "subtasks": { | |
| 24 | + "X-n502-k39": 2.025, | |
| 25 | + "X-n655-k131": 0.6095, | |
| 26 | + "X-n801-k40": 2.006, | |
| 27 | + "X-n856-k95": 1.178, | |
| 28 | + "X-n916-k207": 0.9105, | |
| 29 | + "X-n979-k58": 0.5494, | |
| 30 | + "X-n1001-k43": 1.335, | |
| 31 | + "Antwerp1": 1.591, | |
| 32 | + "Ghent1": 1.693, | |
| 33 | + "Leuven2": 2.303 | |
| 34 | + } | |
| 35 | + } | |
| 36 | + } | |
| 37 | +} | |