The timetabling problem is a multi-constraint and multi-objective combinatorial optimization problems,and had been proved it’s a NP-HARD problem, based on the actual situation of the management process of our university, the use of GA (genetic algorithms) to establish a mathematical model of the university timetabling problem, design a iftness function scheme, selection, crossover and mutation process, evolution to obtain the optimal solution. The experiments results show that the proposed GA can effectively solve the university’s timetabling problem.%排课问题是一个多约束、多目标的组合优化问题,并且已经被证明是一个NP完全问题。本文基于本校教学管理过程的实际情况,利用遗传算法对排课问题建立数学模型,设计了适应度函数,通过选择、交叉和变异等过程,进化得到最优解。实验结果表明该算法能够有效的解决本校的教务智能排课问题。
展开▼