摘要
提出了一种应用于高等院校的自动排考算法。该算法结合了启发式算法的特点,同时建立静态冲突图来降低算法复杂程度,算法充分利用了应用领域经验和规则的优势,提高了自动排考的资源搜索能力。通过在实际工程中应用,表明该算法在解决复杂的高校排考问题时有较好的效果。
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.
出处
《计算机工程与设计》
CSCD
北大核心
2007年第10期2443-2445,共3页
Computer Engineering and Design
关键词
自动排考
启发式算法
静态冲突图
资源搜索
高校排考
automatic examination timetabling
heuristic algorithm
static conflict graph
search resources
university examinationtimetabling
