mlsanityData to 14 Oct 2026

SVRPBench: A Realistic Benchmark for Stochastic Vehicle Routing Problem

arXiv 2505.21887 ↗First posted 28 May 2025cs.AI cs.CE cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 10 of its 38 references that are in the map. First posted on arXiv 28 May 2025.

Builds on

10 of 38 references.

References · 10

  1. 2018Attention, Learn to Solve Routing Problems!cited by 656
  2. 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 348
  3. 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 333
  4. 2023Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalizationcited by 142
  5. 2020Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhoodcited by 125
  6. 2023PyVRP: a high-performance VRP solver packagecited by 52
  7. 2024Self-Guiding Exploration for Combinatorial Problemscited by 22
  8. 2022Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problemscited by 12
  9. 2023Reinforcement Learning for Solving Stochastic Vehicle Routing Problemcited by 3
  10. 2024Adaptive Memory Procedure for Solving Real-world Vehicle Routing Problemcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.