摘要
选课和排课是教务工作的重要组成部分,针对高校内学生自主选课后排课的模式易导致课程之间冲突多、排课难度大的现象,提出了学期课表下对该问题的研究,目标是使得根据学生选课后的排课结果能最大化其选课满意度。首先对选课及排课问题进行了数学描述,建立了相应的模型,并通过设计三阶段式的算法进行求解。在第一阶段,对数据进行预处理,构造学生课程矩阵和课程冲突矩阵;然后通过基于优先级的贪婪思想构建初始可行解,第三阶段通过局部搜索算法对结果进行优化。最后用实际算例测试,与基于课表选课模式下的排课结果进行对比,证明该算法在满足各约束条件的同时能够极大地提高学生的选课满意度。
Course selection and timetabling are important parts of educational administration job. This paper deals with a course timetabling problem for a whole semester based on course selection due to its complexity as the conflicts between two courses grows rapidly. The objective function is to maximize the students＂ satisfaction with the result of course selec- tion after timetabling. First, a mathematical description of the problem is made and the appropriate model is established, then the a three phase approach is described to solve the problem~ at first, data preprocessing is used to calculate the courses conflict matrix and the student course matrix; then a feasible timetable is constructed from the greedy algorithm based on course priority; and finally we try to get a high quality timetable through the neighborhood search algorithm. The results obtained from the proposed algorithm are compared with those of curriculum-based course timetabling, show- ing that the algorithm proposed in the paper can improve the students~ satisfaction with course selection as well as avoid violation of various kinds of constraints.
出处
《系统工程》
CSSCI
CSCD
北大核心
2016年第9期141-147,共7页
Systems Engineering
基金
中央高校基本科研业务费资助项目(2015QN174)
关键词
排课
学期课表
三阶段式算法
自选课程排课
选课满意度
Course Timetabling
Semester Schedules
A Three Phase Approach
Timetabling Based on Course Selection
Satisfaction with Course Selection
