[CPCP] Computational Results
The algorithms were coded in C++ and executed on a single thread of an Intel Core i5-2410M 2.3GHz with 4GB of RAM, running under Linux Mint 17.2 64-bit. GUROBI 6.51 was adopted to solve the MILP models, using its default parameters. A time limit of 600 seconds was allowed for each run.
To evaluate the performance of the proposed algorithm, computational experiments were performed for solving instances (available here) ranging from 50 to 3038 nodes.
The detailed results obtained by the simple ILS algorithm can be accessed here.
The detailed results obtained by the exact methods can be accessed here (literature instances and KIV instances with distances taking integer values).
The detailed results obtained by the exact methods can be accessed here (KIV instances with distances taking float-point values)