CVRPLib Capacitated Vehicle Routing Problem Library

Plot Instance and Solution

Instance: RC2_8_5
  • Number of Customers ($n$): 800
  • Vehicles ($K$): 200
  • Capacity ($Q$): 1000
  • Benchmark: Set Homberger
BKS
  • Value: 17,466.1 not proven optimal
  • Timestamp: 2025/12/31 00:00:00
  • From literature until 2025.
Conventions
  • Objective:
    Minimize the total distance
  • Distance:
    Euclidean truncated to one decimal
  • Solution Cost:
    Distance rounded to one decimal
  • Number of Routes:
    At most K

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