首页 | 本学科首页   官方微博 | 高级检索  
     检索      

大学考试时间表问题的混合遗传算法求解
引用本文:熊焱,郭爵钰.大学考试时间表问题的混合遗传算法求解[J].鞍山科技大学学报,2009(2):164-167.
作者姓名:熊焱  郭爵钰
作者单位:辽宁科技大学理学院;
摘    要:考试时间表问题是一类典型的组合优化问题,也是NP难问题。分析了大学考试时间表编排的特点,给出了一种解决考试时间冲突的自动生成考试时间表的可行时段-查找算法。为进一步解决时间间隔问题,将可行时段-查找算法嵌入到遗传算法中形成混合遗传算法。实验结果表明,本文提出的混合遗传算法能快速、有效的解决大学考试时间表问题。

关 键 词:考试时间表问题  遗传算法  0-1方阵  可行时段  

Hybrid genetic algorithm for university examination timetabling problem
XIONG Yan,GUO Jue-yu.Hybrid genetic algorithm for university examination timetabling problem[J].Journal of Anshan University of Science and Technology,2009(2):164-167.
Authors:XIONG Yan  GUO Jue-yu
Institution:School of Science;University of Science and Technology Liaoning;Anshan 114051;China
Abstract: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 timetabli...
Keywords:examination timetabling problem  hybrid genetic algorithm  0-1 square matrix  feasible time-spot  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号