CVRPLib Capacitated Vehicle Routing Problem Library

Plot Instance and Solution

Instance: XTW-n331
  • Number of Customers ($n$): 330
  • Vehicles ($K$): —
  • Capacity ($Q$): 330
  • Benchmark: Set XTW
BKS
  • Value: 24 / 52,232 not proven optimal
  • Timestamp: 2026/11/04 16:19:25
  • User: Mario (DataFirst Logistics)
    DataFirst Logistics, own solver
Conventions
  • Objective:
    Minimize the number of routes, then the total distance
  • 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.

Route timeline

One row per visit, in route order. The vehicle leaves the depot as late as possible without missing any due date, so only unavoidable waiting remains.

time window ×arrival waiting start of service service travel