Personification Algorithms for the University Timetabling Problem
基于拟人策略的高校排课算法

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.