An Approach for Team Formation Using Modified Grey Wolf Optimizer

The team formation problem is to find a subset of agents, referred to as a team, from a given set of agents such that the team satisfies some desirable property. The computational complexity of this problem is known to be NP-hard. In this paper, we suggest a modified grey wolf optimization approach to find a team with minimum communication cost. The proposed algorithm is evaluated with two real-world data sets, namely the ACM data set and the Academia Stack exchange data set. The experimental results show that the algorithm outperforms some existing approaches with respect to some parameters.