CVRPLib Capacitated Vehicle Routing Problem Library

Plot Instance and Solution

Instance: Antwerp1
  • Number of Customers ($n$): 6000
  • Vehicles ($K$): —
  • Capacity ($Q$): 30
  • Benchmark: Set AGS
BKS
  • Value: 477,256 not proven optimal
  • Timestamp: 2026/11/01 05:42:24
  • User: Arhan Canli (quantavane)
    Reported by Arhan Canli (Quantavane), using HGS-CVRP (Vidal) to re-optimise groups of nearby routes, starting from the published BKS.
Conventions
  • Distance:
    Euclidean rounded to the nearest integer (TSPLIB)
  • Solution Cost:
    Total distance
  • Number of Routes:
    Free

To plot your own solution, upload it on the Check page.

Click a route or a customer to highlight its route; uncheck routes to hide them.