基于分组优化和矩阵运算的自动排课算法  

Automatic Course Arrangement Based on Packet Optimization and Matrix Computation

作　　者：雷涛[1] 王静[1] 徐岩[1] 

机构地区：[1]兰州交通大学电子与信息工程学院,甘肃兰州730070

出　　处：《兰州交通大学学报》2007年第3期97-99,共3页Journal of Lanzhou Jiaotong University

摘　　要：为解决目前高校自动排课系统设计复杂、排课效率低的问题,提出了一种基于分组优化和矩阵运算的自动排课算法.该算法首先对课时段进行分组优化,然后引入矩阵的迭加匹配运算,最终实现自动排课.结果表明,该算法能高效、快速、优化地实现自动排课,并简化了程序的复杂性.Aiming at finding a solution to the problems of the complexity in the process and low effectiveness of curriculum time allotment in automatic arrangement system,a new algorithm for automatic course arrangement is proposed based on the theory of packet optimization and matrix computation. In the process of this algorithm, curriculum time allotment is firstly packet optimized, and then the arrangement process is completed by superposition and matching matrices. Results have shown that the algorithm can work well in solving these problems and making automatic course arrangement system work in an easier, faster and more efficient way.

关 键 词：自动排课 分组优化 排课冲突 迭加匹配 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]