Instance:
CMT9 1
- Number of Customers (n):
150
- Minimum Number of Vehicles (K):
14
- Capacity (Q):
200
- Tigh:
0.8
- Upper Bound (UB):
1162.55 2
- Benchmark:
Christofides, Mingozzi and Toth (1979) [CMT]
- Demand:
[0,41]
- Distance:
EUC 2D
- Files:
1 Instance CMT9 was generated by adding maximum route duration and service time to CMT4. Vechiles are assumed to travel at unitary speed."
2 The solution of cost 1158.41 reported in "An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem", by Dell’Amico, DÃaz DÃaz, Hasle and Iori, Transportation Science (2016), was obtained by truncating the distances after two decimals.
2 Optimal