分剪枝排课算法的设计与实现

Design and Implementation of Branching-and-pruning Algorithm for Course Arrangement

对学分制背景下的排课问题进行了深入的研究与分析.将排课中各类不定和约束因素以规则的形式加以定义,利用这些规则优化探索路径,构造剪枝函数,用动态规划和分枝剪枝的方法来实现排课,从而极大地提高了整个算法的灵活性和可控性以及排课结果的合理性.

This paper makes a deep analysis and study of the course arrangement under the condition of credit system in college.All kinds of uncertain and restraint factors in the course arrangement are defined in the form of rules,and these rules are used to optimize the exploring paths and construct the pruning function.By employing the dynamic planning and the branching-and-pruning method to arrange courses,not only the flexibility and controllability of the entire algorithm but also the reasonability of the course arrangement are greatly enhanced.