高校排课问题与算法分析  

Research on University Course Timetabling Problem and Algorithm Analysis

作　　者：衷田田[1] 

机构地区：[1]韩山师范学院政法系,广东潮州521041

出　　处：《科教文汇》2012年第16期104-105,共2页Journal of Science and Education

摘　　要：高校教务管理工作中,课程安排是一项重要而又复杂的基本工作。排课问题是典型的多重约束和组合优化的问题,通过最优的排列组合合理分配教学资源。本文通过对排课问题基本要素及相互约束条件的分析,结合自身实践描述了课表的编排原则,同时对模拟退火算法、图论法、遗传算法、蚁群算法等主要排课算法的原理和特点进行了阐述。Curriculum arrangement is an important and complex basic work in teaching-affairs management in university.Course arrangement problem,also called timetabling problem,is a typical multiple constraints and combinatorial optimization problems.It needs optimal permutations and combinations to allocate teaching resources rationally.The basic elements of the course timetabling problem and the mutual constraints were analyzed,and the principle of the school timetable scheduling was described by combining with own practice.Meanwhile,the principles and algorithm features based on simulated annealing algorithm,graph theory method,genetic algorithm and ant colony algorithm were discussed in the article.

关 键 词：排课问题 排课算法 教务管理 

分 类 号：G642[文化科学—高等教育学]