摘要
课程表问题是时间表问题之一 ,也是 NP难问题 .根据大学授课形式的特点建立了大学课程表问题的数学模型 ,给出了求解该问题的遗传算法 .根据模型和大学课程表问题的特点设计了一种全新的编码 ,提出了一种新形式的交叉方式 .实验结果表明该方法是可行和有效的 .
University timetable problem is one of the timetable problem and also a NP hard one. This paper analyzes characterizes and then constructs the mathematical model of university timetable problem. A genetic algorithm for the problem is given. A new encoding method and a new crossover operation used in genetic algorithm are provided. The experiment results show that this procedure is infeasible and effective.
出处
《数学的实践与认识》
CSCD
北大核心
2004年第6期82-88,共7页
Mathematics in Practice and Theory