| 大学课程表问题的模型与算法 |
| |
| 引用本文： | 熊焱 王莉 李大卫 张庆灵. 大学课程表问题的模型与算法[J]. 鞍山科技大学学报, 2005, 28(1): 26-29 |
| |
| 作者姓名： | 熊焱 王莉 李大卫 张庆灵 |
| |
| 作者单位： | [1]鞍山科技大学理学院，辽宁鞍山114044／／东北大学理学院，辽宁沈阳1110006 [2]鞍山科技大学理学院，辽宁鞍山114044 |
| |
| 摘 要： | 课程表问题(Tinletabling problem．简称TTP)是时间表问题之一，也是NP难问题。根据大学授课形式的特点建立了大学课程表问题的数学模型．并给出了求解该问题的遗传算法。为了提高解的质量和加快收敛速度，当相同时问段内班级重复出现时，给出了寻找可能的新位置的方法，并将其嵌入遗传算法，实验结果表明该方法是可行和有效的。
|
| 关 键 词： | 课程表问题 模型 遗传算法 NP难问题 |
| 文章编号： | 1672-4410(2005)01-0026-04 |
| 修稿时间： | 2004-11-12 |
Model and algorithm for university timetabling problem |
| |
| XIONG Yan. Model and algorithm for university timetabling problem[J]. Journal of Anshan University of Science and Technology, 2005, 28(1): 26-29 |
| |
| Authors: | XIONG Yan |
| |
| Abstract: | Timetabling problem is not only one of the timetable problems but also a kind of NP-complete problem.According to the characteristics of lecturing method in university,a mathematical model was set up and a genetic algorithm for the problem was introduced.To improve solution quality and accelerate convergence speed,a method of looking for new possible position was provided and was embedded in genetic algorithm when the same classes or courses appear repeatedly at the same time.The experiment result shows that the method is feasible and effective. |
| |
| Keywords: | university timetabling problem model genetic algorithm NP-complete problem |
| 本文献已被 CNKI 维普 等数据库收录！ |
