禁忌搜索求解排课问题的研究

Research on Solving the Problem of the Taboo Search in Curriculum Management

课程编排是高等学校教学管理中一项重要又复杂的工作。计算机技术的不断发展,使我们利用有限的资源,以最优化的形式满足现实的需求成为了现实。本文采用禁忌搜索算法解决排课问题。首先使用网络最大流算法对排课任务进行分组预处理,保证各类型教室的需求数量小于供应数量,同一组任务在同一时间内进行。再使用禁忌搜索找到时间与任务组的最优组合,从而得到课表的编排结果。

Curriculum arrangement is an important and complicated work in the teaching management of colleges and universities. With the continuous development of computer technology, we make use of the limited resources, in order to optimize the form to meet the reality of the demand. In this paper, the taboo search algorithm is used to solve the problem of course arrangement. Firstly, the maximum flow algorithm of the network is used for grouping the task of scheduling, to ensure that the number of requirements of each type of classroom are less than the quanti- ty of supply. The same group of tasks is done at the same time. Then the taboo search is used to find the optimal combination of time and task group so as to get the results of the schedule.