| 大学自动排考算法设计与实现 |
| |
| 引用本文： | 田岭. 大学自动排考算法设计与实现[J]. 计算机工程与设计, 2007, 28(10): 2443-2445 |
| |
| 作者姓名： | 田岭 |
| |
| 作者单位： | 清华大学软件学院,北京,100085 |
| |
| 摘 要： | 提出了一种应用于高等院校的自动排考算法.该算法结合了启发式算法的特点,同时建立静态冲突图来降低算法复杂程度,算法充分利用了应用领域经验和规则的优势,提高了自动排考的资源搜索能力.通过在实际工程中应用,表明该算法在解决复杂的高校排考问题时有较好的效果.
|
| 关 键 词： | 自动排考 启发式算法 静态冲突图 资源搜索 高校排考 |
| 文章编号： | 1000-7024（2007）10-2443-03 |
| 修稿时间： | 2006-04-10 |
Design and realization of university automatic examination timetabling algorithm |
| |
| TIAN Ling. Design and realization of university automatic examination timetabling algorithm[J]. Computer Engineering and Design, 2007, 28(10): 2443-2445 |
| |
| Authors: | TIAN Ling |
| |
| Affiliation: | School of Software, Tsinghua University, Beijing 100085, China |
| |
| Abstract: | A novel algorithm for university automatic examination timetabling is proposed. The heuristic algorithm features is integrated and a static conflict graph is built to reduce the algorithm complexity. Our algorithm utilizes domain knowledge and experience rules, and enhances the performance of resource searching for the purpose of automatic timetabling. The experiment shows that our algorithm is quite effective in solving the comlolex 1oroblem in automatic timetabling. |
| |
| Keywords: | automatic examination timetabling heuristic algorithm static conflict graph search resources university examinationtimetabling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
