The XL Instances for the Capacitated Vehicle Routing Problem

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Queiroga, Eduardo, Martinelli, Rafael, Subramanian, Anand, Uchoa, Eduardo, Vidal, Thibaut
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915735735894016
author Queiroga, Eduardo
Martinelli, Rafael
Subramanian, Anand
Uchoa, Eduardo
Vidal, Thibaut
author_facet Queiroga, Eduardo
Martinelli, Rafael
Subramanian, Anand
Uchoa, Eduardo
Vidal, Thibaut
contents This paper introduces a new set of large-scale benchmark instances for the Capacitated Vehicle Routing Problem (CVRP). The proposed XL set extends existing benchmarks by covering instances with 1,000 to 10,000 customers and a wide range of structural characteristics, following established generation principles from prior CVRP studies. A computational study involving several state-of-the-art algorithms is conducted to provide initial best known solutions (BKSs) for the XL instances, which serve as a baseline for a community-driven BKS challenge launched on the CVRPLib website. The instances are made publicly available to support experimental evaluation and comparison of solution methods. Furthermore, additional computational analyses are reported to compare algorithmic performance on other existing CVRP benchmark instances.
format Preprint
id arxiv_https___arxiv_org_abs_2601_11467
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle The XL Instances for the Capacitated Vehicle Routing Problem
Queiroga, Eduardo
Martinelli, Rafael
Subramanian, Anand
Uchoa, Eduardo
Vidal, Thibaut
Optimization and Control
This paper introduces a new set of large-scale benchmark instances for the Capacitated Vehicle Routing Problem (CVRP). The proposed XL set extends existing benchmarks by covering instances with 1,000 to 10,000 customers and a wide range of structural characteristics, following established generation principles from prior CVRP studies. A computational study involving several state-of-the-art algorithms is conducted to provide initial best known solutions (BKSs) for the XL instances, which serve as a baseline for a community-driven BKS challenge launched on the CVRPLib website. The instances are made publicly available to support experimental evaluation and comparison of solution methods. Furthermore, additional computational analyses are reported to compare algorithmic performance on other existing CVRP benchmark instances.
title The XL Instances for the Capacitated Vehicle Routing Problem
topic Optimization and Control
url https://arxiv.org/abs/2601.11467