Two Phase Heuristic Algorithm for the University Course Timetabling Problem: The Case of University of Dar Es Salaam
Two Phase Heuristic Algorithm for the University Course Timetabling Problem: The Case of University of Dar Es Salaam
复制标题
大学课程安排问题的两阶段启发式算法：以达累斯萨拉姆大学为例
DOI：
10.4314/tjs.v37i1
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
AR Mushi
中科院分区：
文献类型：
--
作者：
AR Mushi
大学课程时间表是将资源（如讲师、课程和教室）安排到计划范围内的多个时间段的问题，通常是一周，同时满足许多特定问题的约束。由于不同院校的排课问题不同，本文基于模拟退火（SA）和两阶段最陡下降法的结合，对达累斯萨拉姆大学的排课问题进行了研究。已经生成的解决方案大大优于手动生成的解决方案。此外，该方法与先前的禁忌搜索方法相比，具有更快的执行时间和更高的房间分配质量。结果表明，在谨慎选择参数的情况下，该方法具有良好的效果。关键词：调度问题，模拟退火，组合优化，最陡下降Tanz。[j]2011年第37卷
University course timetabling is the problem of scheduling resources such as lecturers, courses, and rooms to a number of timeslots over a planning horizon, normally a week, while satisfying a number of problem-specific constraints. Since timetabling problems differ from one institution to another, this paper investigated the case of the University of Dar Es salaam, based on the combination of Simulated Annealing (SA), and steepest descent in a two-phase approach. Solutions have been generated which greatly outperform the manually generated ones. Furthermore, the method compares well with previous work on Tabu Search but with faster execution time and higher quality on rooms allocation. It is concluded that the approach gives good results given a careful selection of parameters. Keywords : Timetabling Problem, Simulated Annealing, Combinatorial Optimization, Steepest Descent Tanz. J. Sci . Vol. 37 2011