用演化算法求解高校排课的问题

Evolutionary Algorithm for Timetabling Problem in Highschool

根据排课问题的有效性约束，建立了基于实际情况的数学模型，提出课元、资源等概念模型。采用演化算法来解决排课问题，根据教师集、班级集、课程集、教室集、时间集、课元集、资源集等概念定义了约束集，再设计了相应的编码和评价方法，采用轮盘选择、单点交叉、随机变异、μ＋λ淘汰等策略进行计算．实验结果表明，用演化算法解决排课问题是可行的。

According to the validation restriction of timetabling problem（TTP）, built up a mathematical moudle for a real problem, providing definitions such as meta course and meta source. Use evolutionary algorithm to solve TTP, basing on .the restriction set built up by teacher set, student-class set, course set, classroom set, time set, meta course set and meta source set. Designed the encoding method and evaluation method. Choosed roulette strategy, single-point crossover strategy, random mutation strategy, and μ＋λ strategy as evolutionary strategies. The results show that evolutionary algorithm is suitable for TTP.