计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (10): 233-236.

• 工程与应用 • 上一篇    下一篇

基于群体优势遗传算法的高校排课问题研究

李红婵1,户 刚2,朱颢东1   

  1. 1.郑州轻工业学院 计算机与通信工程学院,郑州 450002
    2.郑州轻工业学院 电气信息工程学院,郑州 450002
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-04-01 发布日期:2011-04-01

Research of UTP based on population dominant GA

LI Hongchan1,HU Gang2,ZHU Haodong1   

  1. 1.School of Computer and Communication Engineering,Zhengzhou University of Light Industry,Zhengzhou 450002,China
    2.College of Electric and Information Engineering,Zhengzhou University of Light Industry,Zhengzhou 450002,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-04-01 Published:2011-04-01

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

关键词: 高校排课问题, 遗传算法, 二进制编码, 群体优势策略

Abstract: University Timetabling Problem(UTP) is analyzed detailedly,and an optimization mathematical model of UTP is established.The framework structure to solve UTP is founded.According to characteristics of UTP,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,population dominant strategy,adaptive crossover probability and adaptive mutation probability design scheme.Simulation results show that the proposed GA can satisfy multiple constraint conditions and can resolve UTP more effectively.

Key words: University Timetabling Problem(UTP), Genetic Algorithm(GA), binary code, population dominant strategy