DVRP Kilby's instances for Dynamic Vehicle Routing Problem

Published: 12 May 2021| Version 5 | DOI: 10.17632/3fwc3twwn6.5
Michał Okulewicz


The data set consists of 22 Dynamic Vehicle Routing Instances, created by Kilby and Montemanni from the static instances of Christofides, Taillard and Fisher. Each file consists of a set of locations, with their X and Y coordinates, cargo demand and appearance time. Results comparison can be found in Okulewicz, M., & Mańdziuk, J. (2019). A metaheuristic approach to solve Dynamic Vehicle Routing Problem in continuous search space. Swarm and Evolutionary Computation, 48, 44-61. Visualization of 20 best results (up to year 2019) can be found at:


Steps to reproduce

The benchmark needs a manual setup of cut-off time (with typical value in most articles being 0.5). Cut-off time decides which client's requests are available from the beginning of the optimization process.


Politechnika Warszawska


Vehicle Routing Problem, Discrete Optimization