Data Set for the Prize-Collecting Covering Tour Problem

This dataset consist of 144 test problems derived from the traveling salesman problem (TSP) accessible at the TSPLIB repository. The PRIZE is never satisfied with the collection of merely the prizes associated with the vertices from T, in order to avoid any instance of the PCCTP from becoming an instance of the covered tour problem (CTP).

The instances were given new names based on their TSPLIB names, with extra information about the subsets R, T, and W, as well as the proportion of the total PRIZE to be collected. The instance a280_R56_T168_W56_50}, for example, contains the following properties: the total number of vertices are 280, 56 of them are optional (R), 168 are mandatory (T), 56 must be covered (W), and 50% of the total prize must me covered.

本数据集包含144个测试问题，均源自TSPLIB库中的旅行商问题（Traveling Salesman Problem, TSP）。为避免任意一个PCCTP实例退化为覆盖旅行问题（Covered Tour Problem, CTP），本数据集并未仅将T集合顶点所关联的奖金作为收集目标。

这些实例基于其原TSPLIB名称进行重命名，并额外补充了子集R、T、W的相关信息，以及需收集的总奖金占比。以实例a280_R56_T168_W56_50为例，其属性如下：顶点总数为280，其中56个为可选顶点（R）、168个为必选顶点（T）、56个为必须覆盖的顶点（W），且需收集的奖金占总奖金的50%。