A Statistical comparative analysis of Simulated Annealing and Variable Neighborhood Search for the Geographic Clustering Problem

this paper describes a factorial statistical study that compares the quality of solutions produced by two heuristics: simulated annealing (sa) and variable neighborhood search (vns). these methods are used to solve the geographic clustering problem (gcp), and the quality of the solutions produced for specific times has been compared. with the goal of comparing the quality of the solutions, where both heuristics participate in an impartial evaluation, time has been the only common element considered for vns and sa. at this point, two factorial experiments were designed and the corresponding parameters for each heuristic were carefully modeled leaving time as the cost function. in instances of 24 objects, the experiments involved the execution of two sets of tests recording the results of the different response times and the associated values of the objective function for each heuristic and instance conditions. the solution to this problem requires a partitioning process where each group is composed of objects that fulfill better the objective: the minimum accumulated distance from the objects to the centroid of each group. the gcp is a combinatorial np-hard problem (ba？？o, lobo and painho, 2004).