Instance: R1_2_4 1

Zoom Instance
  • Number of Customers (n): 200
  • Minimum Number of Vehicles (K): 2
  • Capacity (Q): 200
  • Tigh:
  • Upper Bound (UB): 3047.6 3
  • Benchmark: Homberger and Gehring (1999) [HG]
  • Demand: [0,43]
  • Distance: EUC 2D
  • Files:
1 Same convention of 12th DIMACS Challenge and recent exact algorithms of only minimizing the total distance. Euclidean distances are obtained from the location coordinates and then truncated to one decimal place.
2 not fixed: K is the minimum feasible number of vehicles
3 Optimal