Abstract
In Artificial Intelligence with Coalition Structure Generation CSG one refers to those cooperative complex problems that require to find an optimal partition maximizing a social welfare of a set of entities involved in a system. The solution of the CSG problem finds applications in many fields such as Machine Learning set covering machines, clustering, Data Mining decision tree, discretization, Graph Theory, Natural Language Processing aggregation, Semantic 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
