CVRPLib Capacitated Vehicle Routing Problem Library

Plot Instance and Solution

Problem

Instance Set

Instance

Instance: XL-n10001-k1570

Number of Customers ($n$): 10000
Vehicles ($K$): 1570
Capacity ($Q$): 479
Benchmark: Set XL

BKS

Value: 2,329,417 not proven optimal
Timestamp: 2026/10/30 16:30:28
User: Laio Oriel Seman (IFSC)

using a modified version of HGS: the incumbent is seeded with the current BKS and improved by repeatedly re-solving small neighborhoods of routes with independent, parallel HGS populations under threshold acceptance and diverse elite restarts.

Conventions

Distance:
Euclidean rounded to the nearest integer (TSPLIB)
Solution Cost:
Total distance
Number of Routes:
Free

Files:

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

Arrows

Depot edges

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