作　　者： ; ;

机构地区： 东莞理工学院

出　　处： 《东莞理工学院学报》 2012年第5期4-8,共5页

摘　　要： 排课问题是一个有约束、多目标的组合优化问题,并且已经被证明是一个NP完全问题。针对高校排课过程中存在诸多约束因素的问题,提出将遗传算法与约束条件算法相结合的排课算法,由约束条件算法确定排课任务的优先次序,遗传算法解决单个排课任务时间片分配的优化问题。实验结果表明,该算法能够改进算法性能,提高排课效率。 Course timetabling is a constrained and multiobjective combined optimization problem, and has been already proved to be a NP complete problem. As to the factors of resource constraints existed in the process of course schedule, this paper proposes an algorithm combining Genetic Algorithm （GA） and constraint satisfaction algorithm to solve course schedule problem. Course schedule tasks are sorted with constraint satisfaction algorithm, and timetable of a single course schedule task is allocated and optimized with GA. Experiments show that this method is feasible to improve the performance and the efficiency.

关 键 词： 遗传算法 约束满足 排课问题

领　　域： [理学] [理学]