Instance:
X-n101-k25
- Number of Customers (n):
100
- Minimum Number of Vehicles (K):
25 1
- Capacity (Q):
206
- Upper Bound (UB):
27591 2
- Benchmark:
Uchoa et al. (2014) [X]
- Demand:
[0,100]
- Distance:
EUC 2D
- Root Positioning:
Random
- Customer Positioning:
Random
- Files:
1 not fixed: K is the minimum feasible number of vehicles
2 Optimal