Multi-Period Workforce Scheduling and Routing for Warranty Repair Services

The data used in computational experiments for the Multi-Period Workforce Scheduling and Routing for Warranty Repair Services study is provided.The locations corresponding to projects, each representing a customer, were taken from a study [1] on a vehicle routing problem. A 400 customer location instance was selected for each of the three problem classes: random (R), cluster (C), and random clustered (RC).[1] Homberger, J. and Gehring, H. (2005). A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research, 162(1):220–238. Logistics: From Theory to Application.本研究针对保修维修服务多周期人员调度与路径规划（Multi-Period Workforce Scheduling and Routing for Warranty Repair Services）所开展的计算实验所用数据集已公开提供。 对应各项目（即每位客户）的位置数据源自一项针对车辆路径问题（Vehicle Routing Problem, VRP）的研究[1]。针对随机型（R）、集群型（C）以及随机集群型（RC）三类问题，各选取了一个含400个客户位置的算例。 [1] Homberger, J. 与 Gehring, H. (2005). 面向带时间窗车辆路径问题的两阶段混合元启发式算法. 《欧洲运筹学杂志》, 162(1):220–238. 《物流：从理论到应用（Logistics: From Theory to Application）》。