<![CDATA[In graph theory, centrality is often assessed using traditional methods such as closeness centrality, which measures the average shortest path length between nodes in a network. In this study, we primarily focus on developing the proposed approach and demonstrating its effectiveness through initial experimental results. A novel genetic algorithm (GA)–based method named centrality–optimized leadership coalition formation (COLCF) has been designed. It emphasizes actual agent distances according to closeness centrality and leadership attributes in group formation. We detail the COLCF algorithm, present empirical case studies, and provide efficiency comparisons. In accordance with our simulation results, the proposed algorithm is capable of capitalizing on the ideal coalition structure for achieving high closeness centrality when incorporated with leadership attributes. The experimental results demonstrate the algorithm’s robustness and effectiveness in addressing complex coalition formation challenges.]]>
Copyrights © 2026
