GRASP and path-relinking for Coalition Structure Generation [article]

Nicola Di Mauro, Teresa M.A. Basile, Stefano Ferilli, Floriana Esposito
2011 arXiv   pre-print
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a social welfare, of a set of entities involved in a system into exhaustive and disjoint coalitions. The solution of the CSG problem finds applications in many fields such as Machine Learning (covering machines, clustering), Data Mining (decision tree, discretization), Graph Theory, Natural Language Processing (aggregation),
more » ... emantic Web (service composition), and Bioinformatics. The problem of finding the optimal coalition structure is NP-complete. In this paper we present a greedy adaptive search procedure (GRASP) with path-relinking to efficiently search the space of coalition structures. Experiments and comparisons to other algorithms prove the validity of the proposed method in solving this hard combinatorial problem.
arXiv:1103.1157v2 fatcat:dtekkqj32rgp3ayj3sdmc5ihwm