团队成员选择的模型及算法

Model on Group Members Selecting and the Algorithm

本文针对组织中组建团队或者重组现有团队时的成员选择问题,提出了反映团队成员之间、成员和团队之间关系的群体效用模型,并根据此模型进行团队成员的选择,从而把团队成员选择问题转化为一个组合优化问题。证明了基于群体效用模型进行团队成员选择的问题是NP hard问题,并且提出了基于GRASP技术和禁忌算法的启发式算法,最后给出了算例。

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.