Kilby's instances for Dynamic Vehicle Routing Problem
Published: 8 November 2018| Version 1 | DOI: 10.17632/3fwc3twwn6.1
Contributor:
Michał Okulewicz
Description
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 appearing time.
Files
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.
Categories
Vehicle Routing Problem, Discrete Optimization