计算机与现代化Issue(7)：15-19,5.DOI:10.3969/j.issn.1006-2475.2015.07.004
基于整数规划的排课优化问题
Course Timetabling Optimization Problem Based on Integer Programming Model
摘要
Abstract
In this paper, by establishing the multiple-objective 0-1 integer programming model which keeps the original curricu-lum time constant, we propose a method for solving university course timetabling problem. This method aims to find the shortest path for class and keep the utilization of classroom resource balanced. In the model, we see the first target as a constraint condi-tion, using the idea “when a class’ s two courses are arranged in a row, then the two courses are arranged in the same class-room”, while we see the second target as the objective function. Eventually the constrained optimization problem is solved by the filter algorithm. The simulation results on small amount of data are also given to show the efficiency of the proposed method.关键词
排课问题/整数规划模型/寻课距离/资源利用均衡Key words
course timetabling problem/integer programming model/distance of two courses/balanced use of classroom resources分类
信息技术与安全科学引用本文复制引用
谢宗霖,刘亚君,霍伟敬,王金环..基于整数规划的排课优化问题[J].计算机与现代化,2015,(7):15-19,5.基金项目
国家自然科学基金资助项目(61203142) （61203142）
国家大学生创新性实验计划项目(201310080013) （201310080013）
