摘要
考试时间表问题是一类典型的组合优化问题,也是NP难问题。分析了大学考试时间表编排的特点,给出了一种解决考试时间冲突的自动生成考试时间表的可行时段-查找算法。为进一步解决时间间隔问题,将可行时段-查找算法嵌入到遗传算法中形成混合遗传算法。实验结果表明,本文提出的混合遗传算法能快速、有效的解决大学考试时间表问题。
Examination timetabling problem is a kind of typical combinatorial optimization problems. The characteristics of university examination timetabling problem was analyzed. For solving the time conflicts, a finding feasible time-spot algorithm was proposed to create the examination timetable automatically. Moreover, hybrid genetic algorithm combining with genetic algorithm was provided for settling spacing time of examination. The experiments verify that this algorithm is useful for solving the examination timetabling problem.
出处
《辽宁科技大学学报》
CAS
2009年第2期164-167,共4页
Journal of University of Science and Technology Liaoning
关键词
考试时间表问题
遗传算法
0-1方阵
可行时段
examination timetabling problem
hybrid genetic algorithrn
0-1 square matrix
feasible time- spot