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

基于小生境遗传算法的排课问题研究
引用本文:李红婵,朱颢东.基于小生境遗传算法的排课问题研究[J].计算机工程,2011,37(16):194-196.
作者姓名:李红婵  朱颢东
作者单位:郑州轻工业学院计算机与通信工程学院,郑州,450002
基金项目:四川省科技厅支撑计划基金资助项目,四川省科技厅应用基础基金资助项目
摘    要:建立排课问题的数学优化模型,构建其基本求解框架,引入遗传算法并设计多种改进方案,包括新的二进制编码方案、初始种群生成方案、适应度函数设计方案、小生境策略、自适应交叉概率和自适应变异概率设计方案.仿真结果表明,该算法能够满足排课问题的多重约束条件,更有效地解决排课问题.

关 键 词:排课问题  遗传算法  二进制编码  小生境策略
收稿时间:2011-01-31

Research on Timetabling Problem Based on Niche Genetic Algorithm
LI Hong-chan,ZHU Hao-dong.Research on Timetabling Problem Based on Niche Genetic Algorithm[J].Computer Engineering,2011,37(16):194-196.
Authors:LI Hong-chan  ZHU Hao-dong
Affiliation:(School of Computer and Communication Engineering,Zhengzhou University of Light Industry,Zhengzhou 450002,China)
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.
Keywords:Timetabling Problem(TP)  Genetic Algorithm(GA)  binary coding  niche strategy
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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