New benchmark instances for the Capacitated Vehicle Routing Problem
Lists
Only you see this
Abstract
Highlights • We show the limitations of existing Capacitated Vehicle Routing Problem instances. • We propose 100 new instances and evaluate recent exact and heuristic methods. • The same generating scheme is used to create an extended benchmark of 600 instances. • Extensive experiments and statistical analyses are done on the extended benchmark. • We present a sophisticated website containing all existing and new instances. Abstract The recent research on the CVRP is being slowed down by the lack of a good set of benchmark instances. The existing sets suffer from at least one of the following drawbacks: (i) became too easy for current algorithms; (ii) are too artificial; (iii) are too homogeneous, not covering the wide range of characteristics found in real applications. We propose a new set of 100 instances ranging from 100 to 1000 customers, designed in order to provide a more comprehensive and balanced experimental setting. Moreover, the same generating scheme was also used to provide an extended benchmark of 600 instances. In addition to having a greater discriminating ability to identify “which algorithm is better”, these new benchmarks should also allow for a deeper statistical analysis of the performance of an algorithm. In particular, they will enable one to investigate how the characteristics of an instance affect its performance. We report such an analysis on state-of-the-art exact and heuristic methods.
BibTeX
@article{uchoa2017new,
author = {Eduardo Uchoa and Diego Pecin and Artur Alves Pessoa and Marcus Poggi and Thibaut Vidal and Anand Subramanian},
title = {{New benchmark instances for the Capacitated Vehicle Routing Problem}},
journal = {Eur. J. Oper. Res.},
year = {2017},
doi = {10.1016/j.ejor.2016.08.012},
}Loading related content...