Model on Group Members Selecting and the Algorithm
Wentian Cui · Yunchou yu guanli · 2005
In this paper we consider the problem of how to appropriately select members when we form a new group or reform a group in an organization. We put forward a model, namely, group utility model, which considers the relations between the members, the relation between the member and the organization. According to the model, we transform the problem of selecting members from the organization to a combinatorial optimization problem. We show that the problem is a NP-hard problem and give a brief proof. Then we give an heuristic algorithm based on GRASP(Greedy Randomized Adaptive Search Procedures) and TABU. And a computing case is studied at last.