This page contains results for the paper “EFFECTION: An Exact Solution Approach for the Formation and Routing of Worker Teams”
You will find full experimental results for this paper. We share six files as follows:
Results_EFFECTION_WTFRP.pdf,
Results_EFFECTION_WTFRPA.pdf,
Analysis_on_standard.pdf,
Analysis_on_uniform.pdf,
Detailed_standard_instance.pdf,
Detailed_uniform_instance.pdf.
We present all results for applying EFFECTION to WTFRP and WTFRPA in “Results_EFFECTION_WTFRP” and “Results_EFFECTION_WTFRPA”, respectively. We impose a time limit of 1,200 seconds on each instance for the WTFRP and a time limit of 600 seconds on each instance for the WTFRPA.
We present the analysis of standard-weight instances in the file “Analysis_on_standard” and the analysis of uniform-weight instances in the file “Analysis_on_uniform”.
We have two files, “Detailed_standard_instance” and “Detailed_uniform_instance”, containing detailed results for each individual instance, where the following information is included: the instance name (Name), objective value (Cost), optimality gap (Gap‱), and computation time in seconds (CPU) for each instance. For ease of presentation, we name an instance by the planning horizon, number of flights per hour, and repetition index, and the ws difference among the instances is distinguished in the first row of each table. For those instances that are infeasible, the corresponding parts in the table are filled with “-” . We use “T” to denote “Reaching the Time limit” and “M” to denote “Out of Memory”.
We implement the algorithm using Java and execute it on an Intel(R) Core i7 2.60 GHz processor equipped with 16.0 GB of RAM. The implementation utilizes Gurobi 11.0.2 as the solver. We impose a time limit of 3,600 seconds on each instance.