Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (34): 242-245.
• 工程与应用 • Previous Articles Next Articles
ZHU Haodong,LI Hongchan
Received:
Revised:
Online:
Published:
朱颢东,李红婵
Abstract: University Timetabling Problem(UTP) is analyzed detailedly,which includes timetabling target,main influencing factors,constraints,and solving target.An optimization mathematical model of UTP is established.The framework structure to solve UTP is founded.According to characteristics of UTP,GA is introduced,a variety of improved schemes are designed,which include three-dimensional code scheme,initial population design scheme,fitness function design scheme,niche strategy,adaptive crossover probability and adaptive mutation probability design schemes.Simulation results show that the proposed GA can satisfy multiple constraint conditions and effectively solve UTP to a certain extent.
Key words: University Timetabling Problem(UTP), Genetic Algorithm(GA), three-dimensional code, niche strategy
摘要: 深入分析了高校排课问题,包括排课目标、主要影响因素、约束条件、求解目标,建立了其数学优化模型,构建了其基本求解框架。针对高校排课问题的特点,引入遗传算法来加以解决,设计了三维编码方案、初始种群生成方案、适应度函数设计方案、小生境策略、自适应交叉概率和自适应变异概率等多种改进方案。仿真结果表明该算法在一定程度上满足了高校排课问题的多重约束条件,能够有效地解决高校排课问题。
关键词: 高校排课问题, 遗传算法, 三维编码, 小生境策略
ZHU Haodong,LI Hongchan. Three-dimensional niche GA used to solve University Timetabling Problem[J]. Computer Engineering and Applications, 2011, 47(34): 242-245.
朱颢东,李红婵. 采用三维小生境遗传算法求解高校排课问题[J]. 计算机工程与应用, 2011, 47(34): 242-245.
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2011/V47/I34/242