CVRP instances

Here are the 240 instances for the "Capacitated Vehicle Routing Problem" used in the article "The Capacitated Vehicle Routing Problem: Stronger Bounds in Pseudo-Polynomial Time", written by Adam Letchord and Juan-Jose Salazar-Gonzalez, and published in "European Journal of Operational Research" 2018. https://doi.org/10.1016/j.ejor.2018.06.002 Each instance has 15 customers and 1 depot, and is in a text file following the TSPLIB95 format for CVRP instances. There are instances with asymmetric (A) and with symmetric (S) distances, with unit demands (U) and with general demands (G). The U instances have vehicle capacity in {4,6,8} and the G instances have vehicle capacity in {100,150,200}.本数据集包含240个有容量约束的车辆路径问题（Capacitated Vehicle Routing Problem）算例，这些算例来自Adam Letchord与Juan-Jose Salazar-Gonzalez撰写、2018年发表于《欧洲运筹学杂志》的论文《有容量约束的车辆路径问题：伪多项式时间下的更强界》，其DOI链接为https://doi.org/10.1016/j.ejor.2018.06.002。每个算例包含15个客户节点与1个配送中心，均以适配于该类算例的TSPLIB95格式存储于文本文件中。本数据集涵盖两类距离类型：非对称距离（A）与对称距离（S），以及两类需求类型：单位需求（U）与一般需求（G）。其中单位需求（U）类算例的车辆容量取值为{4,6,8}，一般需求（G）类算例的车辆容量取值为{100,150,200}。