PVRP-DC-SO instances

These are the 36 instances used in the article "The Periodic Vehicle Routing Problem with Driver Consistency and Service Time Optimization", written by Inmaculada Rodríguez-Martín and Hande Yaman, and published in ……………..
These data files have the same format as the classical PVRP instances from the literature. We have kept this format, but in for the PVPR-DC-SO we skip some of the information in the files. The infomation we do not consider is:
- The maximum duration of a route (denoted by D bellow)
- The vehicles’capacity (denoted by Q bellow)
- The service duration for each customer (denoter by d bellow)

Taking this into account, the files are read in the following way:
The first line contains the following information:
type m n t
where
type = 1 (PVRP),
m = number of vehicles,
n = number of customers,
t = number of days.
The next t lines contain, for each day ,the following information:
D Q
where
D = maximum duration of a route (0 means 'unbounded'),
Q = maximum load of a vehicle.
The next lines contain, for the depot and each customer, the following information:
i x y d q f a list
where
i = customer number (0 corresponds to the depot),
x = x coordinate,
y = y coordinate,
d = service duration,
q = demand,
f = frequency of visit,
a = number of possible visit combinations,
list = list of all possible visit combinations.

Each visit combination is coded with the decimal equivalent of the corresponding binary bit string. For example, in a 5-day period, the code 10 which is equivalent to the bit string 01010 means that a customer is visited on days 2 and 4. (Days are numbered from left to right.)

本数据集包含用于文章《考虑司机一致性和服务时间优化的周期性车辆路径问题》中的36个实例，该文由Inmaculada Rodríguez-Martín和Hande Yaman撰写，并发表于……。这些数据文件与文献中的经典PVRP实例具有相同的格式。我们保留了这一格式，但在PVPR-DC-SO中，我们对文件中的一些信息进行了省略。我们不考虑的信息包括：
- 路线的最大持续时间（以下用D表示）
- 车辆的容量（以下用Q表示）
- 每个客户的服务持续时间（以下用d表示）。

考虑到这些，文件以以下方式读取：
第一行包含以下信息：
- type m n t
其中
- type = 1（PVRP），表示路径车辆问题
- m = 车辆数量
- n = 客户数量
- t = 天数。
接下来的t行包含，对于每一天，以下信息：
- D Q
其中
- D = 路线的最大持续时间（0表示无界），
- Q = 车辆的最大载重。
接下来的行包含，对于仓库和每个客户，以下信息：
- i x y d q f a list
其中
- i = 客户编号（0对应仓库），
- x = x坐标，
- y = y坐标，
- d = 服务持续时间，
- q = 需求，
- f = 访问频率，
- a = 可能的访问组合数量，
- list = 所有可能的访问组合列表。

每个访问组合均以对应二进制位串的十进制等价值进行编码。例如，在一个5天的周期中，代码10，相当于二进制位串01010，表示客户在第二天和第四天被访问。（天数从左至右编号。）