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

Authors:
Nádia Mendes Santos;Gustavo Silva Semaan;Luiz Satoru Ochi
Affiliations:
Instituto de Computação, Universidade Federal Fluminense, Niterói, RJ, Brasil;Instituto de Computação, Universidade Federal Fluminense, Niterói, RJ, Brasil;Instituto de Computação, Universidade Federal Fluminense, Niterói, RJ, Brasil
Venue:
IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
Year:
2012

Citing 5
Cited 0

Tabu Search

Tabu Search
GRASP with Path-Relinking for the SONET Ring Assignment Problem

HIS '05 Proceedings of the Fifth International Conference on Hybrid Intelligent Systems
Path relinking for the vehicle routing problem

Journal of Heuristics
Hybrid heuristics for dynamic resource-constrained project scheduling problem

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A GRASP-based approach to the generalized minimum spanning tree problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.