论文标题
TAIP：任何时间用于将学生团队分配给实习计划的算法
TAIP: an anytime algorithm for allocating student teams to internship programs
论文作者
论文摘要
在需要团队合作的情况下，我们通常有各种特定的任务，我们需要组建一个团队才能执行每个任务。在这里，我们将团队与教育背景下的任务相匹配的问题，特别是在组成学生团队并将他们分配给实习计划的情况下。首先，我们为实习计划问题提供了团队分配的形式化，并显示了最佳解决的计算硬度。此后，我们提出了TAIP，TAIP是一种启发式算法，该算法产生了初始的团队分配，后来在迭代过程中尝试改进的尝试。此外，我们进行了系统的评估，以表明TAIP达到最佳性，并且在时间方面表现优于CPLEX。
In scenarios that require teamwork, we usually have at hand a variety of specific tasks, for which we need to form a team in order to carry out each one. Here we target the problem of matching teams with tasks within the context of education, and specifically in the context of forming teams of students and allocating them to internship programs. First we provide a formalization of the Team Allocation for Internship Programs Problem, and show the computational hardness of solving it optimally. Thereafter, we propose TAIP, a heuristic algorithm that generates an initial team allocation which later on attempts to improve in an iterative process. Moreover, we conduct a systematic evaluation to show that TAIP reaches optimality, and outperforms CPLEX in terms of time.
