3-Phase Heuristics for CMVRP

Description for files of 3-Phase Heuristic’s Instances The format of data and solution files in all directories is as follows: Data files contain the following information: distance_s-distance between suppliers and depots supply-supply of each supplier distance_c-distance between suppliers and depots demand-demand of each customers CapaCenter-capacity of each depot Note that:each depot has a vehicle and capacity of vehicle is equal to capacity of depot Solution files The first line contains the cost of the solution (total traveled in both side, total traveled of backhaul route, total traveled of linehaul route ). The next lines contain, for each route, the following information: l d q list l: number of the depot d: distance traveled of the route q: load of the vehicle list: ordered sequence of customers三相启发式算法算例文件说明 所有目录下的数据文件与求解文件的格式统一如下： 数据文件包含以下信息： - distance_s：供应商（supplier）与配送中心（depot）间的距离 - supply：各供应商的供货量 - distance_c：供应商与配送中心间的距离 - demand：各客户（customer）的需求量 - CapaCenter：各配送中心的容量 注意：每个配送中心配备一台车辆，且车辆载重与该配送中心的容量完全一致。 求解文件 第一行包含该求解方案的成本信息（含总双向行驶里程、回程路线总行驶里程、干线路线总行驶里程）。 后续各行依次给出每条路线的如下信息： l d q list 其中： l：配送中心的编号 d：该路线的总行驶里程 q：车辆的载货量 list：客户的有序访问序列