Multi-Period Workforce Scheduling and Routing for Field Services with Precedence Constraints

The data used in the computational experiments, as well as the results obtained, for the study <i>Multi-Period Workforce Scheduling and Routing for Field Services with Precedence Constraints</i> are 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).The experiments were conducted on the Gadi supercomputer at Australia's National Computational Infrastructure (NCI), utilizing a single core of an Intel Xeon Platinum 8274 (Cascade Lake) 3.2 GHz processor and 4 GB of RAM, which are the standard resource allocations on the NCI system. IBM's CPLEX 22.1.1 was used as a solver.[1] Homberger, J. and Gehring, H. (2005). A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. <i>European Journal of Operational Research</i>, 162(1):220–238. Logistics: From Theory to Application.