Add link to paper
#2
by
nielsr
HF Staff
- opened
README.md
CHANGED
|
@@ -1,7 +1,10 @@
|
|
| 1 |
---
|
| 2 |
-
license: mit
|
| 3 |
language:
|
| 4 |
- en
|
|
|
|
|
|
|
|
|
|
|
|
|
| 5 |
tags:
|
| 6 |
- Optimization
|
| 7 |
- combinatorics
|
|
@@ -9,10 +12,8 @@ tags:
|
|
| 9 |
- SVRP
|
| 10 |
- Logistics
|
| 11 |
- Transportation
|
| 12 |
-
pretty_name: SVRPBench Dataset
|
| 13 |
-
size_categories:
|
| 14 |
-
- 10K<n<100K
|
| 15 |
---
|
|
|
|
| 16 |
# π SVRPBench
|
| 17 |
|
| 18 |
SVRPBench is an open and extensible benchmark for the Stochastic Vehicle Routing Problem (SVRP). It includes 500+ instances spanning small to large scales (10β1000 customers), designed to evaluate algorithms under realistic urban logistics conditions with uncertainty and operational constraints.
|
|
@@ -118,5 +119,4 @@ If you use this benchmark in your research, please cite:
|
|
| 118 |
|
| 119 |
This project is licensed under the MIT License.
|
| 120 |
|
| 121 |
-
|
| 122 |
-
- π Paper: [Arxiv](https://arxiv.org/abs/2505.21887)
|
|
|
|
| 1 |
---
|
|
|
|
| 2 |
language:
|
| 3 |
- en
|
| 4 |
+
license: mit
|
| 5 |
+
size_categories:
|
| 6 |
+
- 10K<n<100K
|
| 7 |
+
pretty_name: SVRPBench Dataset
|
| 8 |
tags:
|
| 9 |
- Optimization
|
| 10 |
- combinatorics
|
|
|
|
| 12 |
- SVRP
|
| 13 |
- Logistics
|
| 14 |
- Transportation
|
|
|
|
|
|
|
|
|
|
| 15 |
---
|
| 16 |
+
|
| 17 |
# π SVRPBench
|
| 18 |
|
| 19 |
SVRPBench is an open and extensible benchmark for the Stochastic Vehicle Routing Problem (SVRP). It includes 500+ instances spanning small to large scales (10β1000 customers), designed to evaluate algorithms under realistic urban logistics conditions with uncertainty and operational constraints.
|
|
|
|
| 119 |
|
| 120 |
This project is licensed under the MIT License.
|
| 121 |
|
| 122 |
+
- π Paper: [Arxiv](https://arxiv.org/abs/2505.21887) / [Hugging Face](https://huggingface.co/papers/2505.21887)
|
|
|