作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (16): 194-196. doi: 10.3969/j.issn.1000-3428.2011.16.066

• 人工智能及识别技术 • 上一篇    下一篇

基于小生境遗传算法的排课问题研究

李红婵,朱颢东   

  1. (郑州轻工业学院计算机与通信工程学院,郑州 450002)
  • 收稿日期:2011-01-31 出版日期:2011-08-20 发布日期:2011-08-20
  • 作者简介:李红婵(1983-),女,硕士、CCF会员,主研方向:智能信息处理;朱颢东,博士、CCF会员
  • 基金资助:
    四川省科技厅支撑计划基金资助项目(2008FZ0109);四川省科技厅应用基础基金资助项目(2009JY0134)

Research on Timetabling Problem Based on Niche Genetic Algorithm

LI Hong-chan, ZHU Hao-dong   

  1. (School of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China)
  • Received:2011-01-31 Online:2011-08-20 Published:2011-08-20

摘要: 建立排课问题的数学优化模型,构建其基本求解框架,引入遗传算法并设计多种改进方案,包括新的二进制编码方案、初始种群生成方案、适应度函数设计方案、小生境策略、自适应交叉概率和自适应变异概率设计方案。仿真结果表明,该算法能够满足排课问题的多重约束条件,更有效地解决排课问题。

关键词: 排课问题, 遗传算法, 二进制编码, 小生境策略

Abstract: An optimization mathematical model of Timetabling Problem(TP) is established. The framework structure to solve TP is founded. According to characteristics of TP, Genetic Algorithm(GA) is introduced, a variety of improved schemes are designed, which include new binary code scheme, initial population design scheme, fitness function design scheme, niche strategy, adaptive crossover probability and adaptive mutation probability design scheme. Simulation results show that the proposed GA can satisfy multiple constraint conditions and resolve TP more effectively.

Key words: Timetabling Problem(TP), Genetic Algorithm(GA), binary coding, niche strategy

中图分类号: