Dindar OzTolga Bugra AltuntasAltuntas, Tolga BugraOz, Dindar2025-10-0620241547-58161553-166X10.3934/jimo.20231192-s2.0-85184667499http://dx.doi.org/10.3934/jimo.2023119https://gcris.yasar.edu.tr/handle/123456789/6165https://doi.org/10.3934/jimo.2023119The coalition formation problem (CFP) is a crucial component of multi-agent systems (MAS) taking place in various areas in the real world with different variants. This study proposes a parallel metaheuristic algorithm for CFP. Our hybrid method combines two metaheuristic algorithms: the Scatter Search and the Beam Search. While the former ensures that the algorithm thor-oughly explores the search space the latter exploits the visited regions. We re-design Scatter Search's original implementation to perform the time-consuming independent areas of the task in parallel. We employ a perturbation mechanism inside the Beam Search that performs a big jump in the search space when it cannot find any improvement. Moreover we design a problem-specific repre-sentation that stores meta-information to save significant computational time. The proposed method is examined in parallel and sequential configurations and compared with an exact solver recent metaheuristic algorithms and the standard implementation of the Scatter Search. The experimental results show that our solution achieves considerable improvements in both configurations.Englishinfo:eu-repo/semantics/openAccessCoalition formation problem, Scatter Search, Beam Search, multi-agent systems, parallel algorithmsALLOCATIONParallel AlgorithmsMulti-Agent SystemsCoalition Formation ProblemScatter SearchBeam SearchArticle