%0 Journal Article
%T Solution to course scheduling problems based on genetic algorithm and tabu search<br>基于遗传禁忌算法结合解决排课问题
%A CHEN Shou-jia
%A FU Xia
%A ZHOU Xin
%A <br>陈守家
%A 付霞
%A 周欣
%J 计算机应用
%D 2007
%I 
%X Course scheduling problem is a type of NP-hard problems.Usually,it can be solved by utilizing genetic algorithm.Tabu search algorithm was combined with genetic algorithm to improve the performance.Furthermore,by altering the individual fitness computation method,the curriculum schedule polarization phenomena can be avoided.Experimental results indicate that the method is feasible and has better performance.
%K course scheduling problem
%K NP-hard problem
%K genetic algorithm
%K tabu search
%K GATS algorithm<br>排课问题
%K NP-Hard问题
%K 遗传算法
%K 禁忌算法
%K 遗传禁忌算法
%K 遗传禁忌算法
%K 结合
%K 排课问题
%K tabu
%K search
%K genetic
%K algorithm
%K based
%K problems
%K scheduling
%K course
%K 结果
%K 实验
%K 两极分化现象
%K 课表
%K 计算方法
%K 适应度
%K 算法性能
%K 改进
%K 搜索方法
%K 局部
%K 遗传算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=14E16CBD2743051246A49EC251F46D85&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=DF92D298D3FF1E6E&sid=6C44E62EE1A19DA5&eid=F3258B10DFC889AC&journal_id=1001-9081&journal_name=计算机应用&referenced_num=7&reference_num=9