摘要： 简析高校排课问题，建立相应的数学优化模型，构建基本求解框架。根据该问题的特点，引入遗传算法加以解决，设计多种改进方案，主要包括：新的二进制编码方案，初始种群生成方案，适应度函数设计方案，最佳个体置换策略，自适应交叉概率和自适应变异概率设计方案。仿真实验结果表明，该算法能满足高校排课问题的多重约束条件，更有效地解决高校排课问题。
关键词:
排课问题,
遗传算法,
二进制编码,
最佳个体置换策略
Abstract: University Timetabling Problem(TP) is analyzed. An optimization mathematical model of university TP is established, and the framework structure to solve university TP is founded. According to characteristics of university TP, Genetic Algorithm(GA) is introduced. A variety of improved schemes are designed , which include: new binary code scheme, initial population design scheme, fitness function design scheme, the best individual replacement strategy, adaptive crossover probability and adaptive mutation probability design scheme. Simulation results show the method can satisfy multiple constraint conditions and resolve university TP more effectively.
Key words:
Timetabling Problem(TP),
Genetic Algorithm(GA),
binary coding,
the best individual replacement strategy
中图分类号:
李红婵, 朱颢东. 基于最佳个体置换策略的高校排课问题求解[J]. 计算机工程, 2011, 37(19): 186-188,200.
LI Gong-Chan, SHU Hao-Dong. University Timetabling Problem Solving Based on the Best Individual Replacement Strategy[J]. Computer Engineering, 2011, 37(19): 186-188,200.