基于变邻域搜索的大学师生指派问题
Variable Neighborhood Search for the University Lecturer-Student Assignment Problem
摘要：
本文研究了一般的局部搜索算法和变邻域搜索算法，并将其应用于高校实际工作中的一个分配问题的求解。在这里，学生必须被分配到由工作人员提出和支持的科学主题。该问题涉及到学生在申请某些主题时可能表达的给定偏好下的优化。可以观察到，可变邻域搜索导致测试问题实例的优越结果。一个实例取自实际案例，而其他实例则基于真实世界的数据生成，以支持更深入的分析。问题的扩展已经制定了第二个目标函数，同时平衡工作人员的工作量，同时最大限度地提高学生的效用。算法方法已在计算机系统中原型实现。这方面的一个重要方面是将研究工作应用于其他科学机构的问题，从而提供决策支持功能。
英文摘要：
The paper presents a study of local search heuristics in general and variable neighborhood search in particular for the resolution of an assignment problem studied in the practical work of universities. Here, students have to be assigned to scientific topics which are proposed and supported by members of staff. The problem involves the optimization under given preferences of students which may be expressed when applying for certain topics. It is possible to observe that variable neighborhood search leads to superior results for the tested problem instances. One instance is taken from an actual case, while others have been generated based on the real world data to support the analysis with a deeper analysis. An extension of the problem has been formulated by integrating a second objective function that simultaneously balances the workload of the members of staff while maximizing utility of the students. The algorithmic approach has been prototypically implemented in a computer system. One important aspect in this context is the application of the research work to problems of other scientific institutions, and therefore the provision of decision support functionalities.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
