VDSP instances

These are the 69 instances used in the article: B. Domínguez-Martín, I. Rodríguez-Martín, J.J. Salazar-González, 2017. An exact algorithm for a Vehicle-and-Driver Scheduling Problem. Computers & Operations Research, vol. 81, pp.247-256. https://doi.org/10.1016/j.cor.2016.12.022. The instance name gives information about the number of nodes, the number of vehicles of each type available at the depots, and the class of the instance. For example, n16-1-1-1-1a.dat is an instance with 16 nodes, including the depots, one vehicle of each type at each depot, and the class of the instance is a. These data files have the same format as the classical CVRP instances from the literature, but some new parameters have been added. That is: The first line contains the name of the instance. The next lines contain: TYPE = ‘CVRP’ because the instances are CVRP instances adapted to our problem. DIMENSION = the number of nodes, including the depots EDGE_WEIGHT_TYPE = ‘EUC_2D’ because we use the Eucliden distance for all our instances. The next lines contains the capacity of the vehicles of type 1 (CAPACITY Y) and the capacity of the vehicles of type 2 (CAPACITY X). VEHICLES1 and VEHICLES 2 denotes the number of vehicles of type 2 available at first and second depot, respectively. DRIVERS1 and DRIVERS2 denotes the number of vehicle of type 1 available ar first and seconds depot, respectively. The lines after NODE_COORD_SECTION contain the following information: n x y where n=customer number (1 and the last number correspond to the depots), x=x coordinate, y=y coordinate. The lines after DEMAND_SECTION show the following information: n d where n=customer number (0 and the last number correspond to the depots), d=customer demand(0 for the depots and 1 for the customers) Finally, DEPOT_SECTION1 and DEPOT_SECTION2 indicate that the first and the last node represent the first and the second depot, respectively.