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.)本数据集包含论文《考虑驾驶员一致性与服务时间优化的周期车辆路径问题》（The Periodic Vehicle Routing Problem with Driver Consistency and Service Time Optimization）中使用的36个算例，该论文由Inmaculada Rodríguez-Martín与Hande Yaman撰写，发表于…… 这些数据文件的格式与文献中经典的周期车辆路径问题（Periodic Vehicle Routing Problem, PVRP）算例保持一致。本次数据集沿用了该格式，但针对PVPR-DC-SO省略了文件中的部分信息。未纳入考量的信息如下： - 单条路径的最大时长（下文记为D） - 车辆的最大载货容量（下文记为Q） - 每位客户的服务时长（下文记为d） 基于上述调整，数据文件的读取规则如下： 第一行包含如下信息： type m n t 其中： type 取值为1（代表周期车辆路径问题）， 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，代表客户将在第2天和第4天被访问（天数从左至右依次编号）。