基于约束满足和遗传算法的排课算法  

Course Schedule Algorithm Based on Constraint Satisfaction and Genetic Algorithm

作　　者：许秀林[1] 胡克瑾[2] 

机构地区：[1]南通职业大学电子工程系,南通226007 [2]同济大学经济管理学院,上海200092

出　　处：《计算机工程》2010年第14期281-284,共4页Computer Engineering

摘　　要：针对高校排课过程中存在诸多资源约束因素的问题,提出一种将遗传算法与约束满足算法相结合的排课算法,由约束满足算法确定排课任务的优先次序,遗传算法解决单个排课任务时间片分配的优化问题。算法中单个排课任务的局部最优解具有全局最优性。实验结果表明,该算法能够改进算法性能,提高排课效率。Aiming at the factors of resource constraints that exist 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 a single course schedule task＇s timetable is allocated and optimized with GA.In this algorithm,the result of single course schedule task is global optimal.Experimental results show that this method is feasible to improve the performance and the efficiency.

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

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