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

基于群体优势遗传算法的高校排课问题研究
引用本文:李红婵,户刚,朱颢东.基于群体优势遗传算法的高校排课问题研究[J].计算机工程与应用,2011,47(10):233-236.
作者姓名:李红婵  户刚  朱颢东
作者单位:1. 郑州轻工业学院,计算机与通信工程学院,郑州450002
2. 郑州工业学院,电气信息工程学院,郑州450002
摘    要:深入分析了高校排课问题,建立了高校排课问题的数学优化模型,构建了基本求解框架。针对高校排课问题的特点,引入遗传算法来加以解决,设计了多种改进方案:新的二进制编码方案、初始种群生成方案、适应度函数设计方案、群体优势策略、自适应交叉概率和自适应变异概率设计方案。仿真结果表明该算法能够满足高校排课问题的多重约束条件,能更有效地解决高校排课问题。

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

Research of UTP based on population dominant GA
LI Hongchan,HU Gang,ZHU Haodong.Research of UTP based on population dominant GA[J].Computer Engineering and Applications,2011,47(10):233-236.
Authors:LI Hongchan  HU Gang  ZHU Haodong
Affiliation: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
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 re-solve UTP more effectively.
Keywords:University Timetabling Problem(UTP)  Genetic Algorithm(GA)  binary code  population dominant strategy
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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