• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2011, Vol. 33 ›› Issue (6): 186-190.

• 论文 • 上一篇    

采用十进制最佳个体置换遗传算法求解高校排课问题

朱颢东,李红婵   

  1. (郑州轻工业学院计算机与通信工程学院,河南 郑州 450002)
  • 收稿日期:2010-06-17 修回日期:2010-09-28 出版日期:2011-06-25 发布日期:2011-06-25
  • 作者简介:朱颢东(1980),男,河南虞城人,博士,讲师,CCF会员(E200012527M),研究方向为文本挖掘、智能信息处理和计算智能。李红婵(1983),女,河北石家庄人,硕士,助教,CCF会员(E200014642G),研究方向为智能信息处理。

Using a Decimal Optimum Chromosome to Replace GA to Solve UTP

ZHU Haodong,LI Hongchan   

  1. (School of Computer and Communication Engineering,
    Zhengzhou University of Light Industry,Zhengzhou 450002,China)
  • Received:2010-06-17 Revised:2010-09-28 Online:2011-06-25 Published:2011-06-25

摘要:

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

关键词: 高校排课问题, 遗传算法, 十进制编码, 最佳个体置换策略

Abstract:

The University Timetabling Problem (UTP) is detailedly analyzed, an optimization mathematical model of UTP is established, and the framework structure to solve UTP is founded. According to characteristics of UTP, GA is introduced, and a variety of improved schemes are designed , which include the decimal code scheme, the initial population design scheme, the fitness function design scheme, the optimum chromosome replacing strategy, and the adaptive crossover probability and adaptive mutation probability design scheme. The simulation results show that the proposed GA can satisfy multiple constraint conditions and resolve UTP more effectively.

Key words: UTP;GA;decimal code;optimum chromosome replacing strategy