Metaheuristic GRASP with path-relinking to the solution of the graph partitioning problem with capacity and connexity constraints

Abstract

This work proposes new hybrids algorithms based in the Greedy Randomized Adaptative Search Procedure (GRASP) metaheuristic and Path-Relinking (PR) procedure for the solution of the Clustering Problem with Capacity and Connectedness Constraints. Computational results show the proposed methods to be competitive in relation to instances in the literature and to existing techniques. © 2012 Springer-Verlag.