Driver and Vehicle Routing Problem (DVRP) instances

This is a set of 81 instances for the DVRP. There are 25 instances, wiht 10, 15, 20, and 25 nodes, used in the article: Domínguez-Martín B., Rodríguez-Martín I., Salazar-González J.J. (2018) The Driver and Vehicle Routing Problem. Computers & Operations Research, vol. 92, pp.56-64. https://doi.org/10.1016/j.cor.2017.12.010, plus another 16 instances with 50 nodes used in: Domínguez-Martín B., Rodríguez-Martín I., Salazar-González JJ. (2018) A Heuristic Approach to the Driver and Vehicle Routing Problem. In: Cerulli R., Raiconi A., Voß S. (eds) Computational Logistics. ICCL 2018. Lecture Notes in Computer Science, vol 11184, pp 295-305. Springer, Cham. https://doi.org/10.1007/978-3-030-00898-7_19 plus another group of 40 large instances (wiht 100, 200, 300, 400, 500, 600, 800, and 1000 nodes) used in: Domínguez-Martín B., Rodríguez-Martín I., Salazar-González JJ. (2021). A Two-Phase Multistart Heuristic for the Driver and Vehicle Routing Problem. Working paper, University of La Laguna. Instances' names give information about the number of nodes. For example, n10-1.dat is the first instance with 10 nodes. In each file, the first lines contain: NAME = the name of the instances TYPE = does not apply here EDGE_WEIGHT_TYPE = ‘EUC_2D’ because we use the Eucliden distance for all our instances. DIMENSION = the number of nodes, including the depots The lines after NODE_COORD_SECTION contain the following information: n x y where n = node number x = x coordinate, y = y coordinate. Finally, DEPOT_SECTION1 and DEPOT_SECTION2 indicate that the first and the last node represent the first and the second depot, respectively.本数据集包含面向车辆与驾驶员路径规划问题（Driver and Vehicle Routing Problem，DVRP）的81个算例。 其中包含25个节点数分别为10、15、20、25的算例，出自文献： Domínguez-Martín B., Rodríguez-Martín I., Salazar-González J.J. (2018) 《The Driver and Vehicle Routing Problem》, *Computers & Operations Research*, 第92卷，第56-64页，DOI: 10.1016/j.cor.2017.12.010。 此外另有16个含50个节点的算例，出自： Domínguez-Martín B., Rodríguez-Martín I., Salazar-González J.J. (2018) 《A Heuristic Approach to the Driver and Vehicle Routing Problem》，收录于Cerulli R., Raiconi A., Voß S.主编的《Computational Logistics》（ICCLL 2018），《Lecture Notes in Computer Science》第11184卷，第295-305页，Springer, Cham，DOI: 10.1007/978-3-030-00898-7_19。 还有一组共40个大型算例，节点数涵盖100、200、300、400、500、600、800及1000，出自： Domínguez-Martín B., Rodríguez-Martín I., Salazar-González J.J. (2021) 《A Two-Phase Multistart Heuristic for the Driver and Vehicle Routing Problem》，拉古纳大学工作论文。 算例名称可反映其节点规模，例如n10-1.dat代表含10个节点的第1个算例。 每个数据文件的首行依次包含以下信息： NAME：算例名称 TYPE：无适用类型 EDGE_WEIGHT_TYPE：‘EUC_2D’，即所有算例均采用欧氏距离计算边权重 DIMENSION：节点总数，含配送中心 NODE_COORD_SECTION后的行格式为：n x y，其中n为节点编号，x为x坐标，y为y坐标。 最后，DEPOT_SECTION1与DEPOT_SECTION2分别表示首个节点与末个节点对应第一、第二配送中心。