摘要
面向高校整体教学资源环境下的复杂多约束排课问题,提出了一种启发式方法.基于实际教学过程中涉及学生、任课教师、上课教室,以及各自的可行时间段等教学资源下的复杂多约束条件建立了约束函数,构建了以学生每周上课节次的均匀度与教师对任课时间满意度最大化为目标函数的优化模型.在求解过程中,将各约束条件转化为关系代数的关系运算,在缩小解空间的基础上进而采用启发式策略进行优选.最后,以一个实际高校的排课算例验证本文方法的有效性.
The paper studies the university course timetabling problem （UCTP） with the practical-relevant problems based on the union teaching resources of a university for undergraduates, postgraduates and PhD. students. A new heuristic method for UCTP is presented,considering complex multi-constraint conditions based on the uniform teaching resources which include students, teachers and classrooms with feasible times lot, respectively. The constraints are modeled and the objective function is proposed based on the evenness for all the curriculums of a student and a teacher＇s satisfaction for his/herlecturing time. And then, transform the constraints to relational operation expressed by relation algebra. Thereby heuristic rules are formed by relational calculus. Greedy strategy is applied to search the optimal solutions in the shrunk solution space. Finally, a course timetabling instance from a university is carried out to demonstrate the validation of the new method.
出处
《系统工程学报》
CSCD
北大核心
2015年第6期836-843,共8页
Journal of Systems Engineering
基金
辽宁省研究生培养机制改革研究资助项目(201310151-40)
大连海事大学研究生教育教学改革资助项目(YJG2013001)
中央高校基本科研业务费资助项目(01750312)
关键词
高校排课问题
优化
启发式算法
关系运算
university course timetabling problem
optimization
heuristic algorithm
relational operation
