We lifted 2 functions out of this paper's own repositories and ran 2 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| yehias21/vrp-benchmarks | canonical | 2 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| load_dataset | Ran | yehias21/vrp-benchmarks/vrp_bench/common.py code served (permissive licence) · get_code("18a3a9148140b768") |
| load_npz | Ran | yehias21/vrp-benchmarks/vrp_bench/dataset.py code served (permissive licence) · get_code("8fee1e9cb8e95fd1") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Robust routing under uncertainty is central to real-world logistics, yet most benchmarks assume static, idealized settings. We present SVRPBench, the first open benchmark to capture high-fidelity stochastic dynamics in vehicle routing at urban scale. Spanning more than 500 instances with up to 1000 customers, it simulates realistic delivery conditions: time-dependent congestion, log-normal delays, probabilistic accidents, and empirically grounded time windows for residential and commercial clients. Our pipeline generates diverse, constraint-rich scenarios, including multi-depot and multi-vehicle setups. Benchmarking reveals that state-of-the-art RL solvers like POMO and AM degrade by over 20% under distributional shift, while classical and metaheuristic methods remain robust. To enable reproducible research, we release the dataset and evaluation suite. SVRPBench challenges the community to design solvers that generalize beyond synthetic assumptions and adapt to real-world uncertainty.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2505.21887")
get_code_for_paper("2505.21887")
have("2505.21887")
Connect an agent — have() is free.