%0 Journal Article
%T Personification Algorithms for the University Timetabling Problem<br>基于拟人策略的高校排课算法
%A CHEN Wei-Dong LI Ji-Gui
%A <br>陈卫东
%A 李吉桂
%J 计算机科学
%D 2003
%I 
%X For the university timetabling problem that is NP-hard, some new strategies of tackling it are proposed, and two heuristic algorithms based on personification strategies are presented, which outperform the known straightforward heuristic algorithms in the quality of solution- The experimental results show that our algorithms are practical.
%K Timetabling
%K NP-hardness
%K Personification
%K Heuristic algorithms<br>NP问题
%K 排课算法
%K 直接启发式算法
%K 拟人策略
%K 高校
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=3F0AD22A7551DDFE&yid=D43C4A19B2EE3C0A&vid=340AC2BF8E7AB4FD&iid=59906B3B2830C2C5&sid=9D453329DCCABB94&eid=A58CF3BAE79427D0&journal_id=1002-137X&journal_name=计算机科学&referenced_num=3&reference_num=7