期刊文献+

采用三维最佳个体置换遗传算法求解高校排课问题 被引量:2

Solution to university timetabling problem with genetic algorithm of three-dimensional optimum chromosome replacement
下载PDF
导出
摘要 分析高校排课问题,建立该问题的数学优化模型,并构建模型的基本求解框架.针对高校排课问题的特点,引入遗传算法加以解决,设计多种改进方案,包括三维编码方案、初始种群生成方案、适应度函数设计方案、最佳个体置换策略、自适应交叉概率和自适应变异概率.仿真结果表明,该算法能够满足高校排课问题的多重约束条件,能更有效地解决高校排课问题. University timetabling problem(UTP) was analyzed,a mathematical optimization model of UTP was established,and the framework was constructed for solving UTP.According to the feature of UTP,a genetic algorithm(GA)was introduced and various improvement schemes were designed,including: three-dimensional coding scheme,initial population generating scheme,fitness function design scheme,optimum chromosome replacement strategy,adaptive crossover probability,and adaptive mutation probability.Simulation result showed that the proposed GA could satisfy multiple constraint conditions of UTP and resolve UTP more effectively.
作者 李娜 刘俊辉
出处 《兰州理工大学学报》 CAS 北大核心 2011年第4期110-114,共5页 Journal of Lanzhou University of Technology
基金 河南省社科联科研项目(SKL-2010-1968 SKL-2010-1158)
关键词 高校排课问题 遗传算法 三维编码 最佳个体置换策略 UTP GA three-dimensional coding optimum chromosome replacement strategy
  • 相关文献

参考文献10

  • 1ADEWUMI A O, SAWYERR B A,MONTAZ A M. A heuristic solution to the university timetabling problem [J]. Engineering Computations, 2009,26(8) : 972-984.
  • 2SHI Juan. Research on application of IGA (immune genetic algorithm) to the solution of course-timetabling problem [C]//Proceedings of 2009 4th International Conference on Computer Science and Education. Nanning: [s. n.], 2009: 1109-1105.
  • 3ALADAG C H, HOCAOGLU G,BASARAN M A. The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem [J]. Expert Systems with Applications,2009,36(10):12349-12356.
  • 4DETTIENNE B, PERIDY L, PINSONE. Cut generation for an employee timetabling problem [J]. European Journal of Operational Research, 2009,197 (3) : 1178-1184.
  • 5PILLAY N, BANZHAF W. A study of heuristic combinations for hyper-heuristie systems for the uncapacitated examination timetabling problem [J]. European Journal of Operational Research, 2009,197 (2) : 482-491.
  • 6LEE Y S, CHEN C Y. A heuristic for the train pathing and timetabling problem [J]. Transportation Research Part B: Methodological, 2009,43 (9) : 837-851.
  • 7ZHANG Defu, LIU Yongkai, HALLAH R M. A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems [J]. European Journal of Operational Research, 2010,203 (3) : 550-558.
  • 8ANMAR A, MASR A. Muhi-neighbourhood particle collision algorithm for solving course timetabling problems [C]//Proc of 2009 2nd Conference on Data Mining and Optimization. Selangor: Malaysia, 2009 : 21-27.
  • 9GUYON O, LEMAIRE P, PINSON E. Cut generation for an integrated employee timetabling and production scheduling problem [J]. European Journal of Operational Research, 2010, 201 (2) : 557-567.
  • 10PILLAY N, BANZHAF W. An informed genetic algorithm for the examination timetabling problem [J]. Applied Soft Computing, 2010,10 (2) : 457-467.

同被引文献7

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部