基于改进遗传算法的排课方法研究  

Reaserch of Cource Scheduling Method Based on Improved Genetic Algorithm

作　　者：马传志[1] 刁树民[1] 张晓勇[1] 薛佳葿 

机构地区：[1]佳木斯大学,黑龙江佳木斯154007

出　　处：《中原工学院学报》2013年第2期54-56,共3页Journal of Zhongyuan University of Technology

基　　金：黑龙江省教育厅科学技术研究项目(12521545)

摘　　要：列举了排课问题中的软约束条件和硬约束条件,提出了一种基于遗传算法的新排课方法.该方法合理安排了高校排课过程中的各种资源,对传统遗传算法做了改进,采用了自适应的交叉概率和变异概率,改善了排课的收敛性和效率.In this paper, soft constraints and hard constraints of course scheduling are listed. A new course scheduling method based on improved genetic algorithm is presented. In this algorithm, traditional genetic algorithm is improved, and adaptive crossover probability and mutation probability are adopted. In this algorithm, a variety of resource of the university course scheduling process is reasonably arranged, the algorithm improve the convergence and efficiency of course arrangement.

关 键 词：课表 遗传算法 计算机 

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