.png){kind=icon}
返回
A set partitioning based goal programming model for the team formation problem
.png){kind=icon}
PRE
AI
DOI：10.1111/itor.13022.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we offer a multi-objective set-partitioning formulation for team formation problems using goal programming. Instead of selecting team members to teams, we select suitable teams from a set of teams. This set is generated using a heuristic algorithm that uses the social network of potential team members. We then utilize the proposed multi-objective formulation to select the desired number of teams from this set that meets the skill requirements. Therefore, we ensure that selected teams include individuals with the required skills and effective communication with each other. Two real datasets are used to test the model. The results obtained with the proposed solution are compared with two well-known approaches: weighted and lexicographic goal programming. Results reveal that weighted and lexicographic goal programming approaches generate almost identical solutions for the datasets tested. Our approach, on the other hand, mostly picks teams with lower communication costs. Even in some cases, better solutions are obtained with the proposed approach. Findings show that the developed solution approach is a promising approach to handle team formation problems.
Keyword:
team formation
social network
multi-objective optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
.png){kind=icon}
查看更多内容