Abstract
This paper describes the University Course Timetabling Problem (UCTP) used in the International Timetabling Competition 2003 organized by the Metaheuristics Network and presents a state-of-the-art heuristic approach towards the solution of the competition instances. It is a greatly improved version of the winning competition entry. The heuristic is divided into three phases: at first, a feasible timetable is constructed, then Simulated Annealing (SA) is used to order the thus created time-slots optimally, and finally SA is used to swap individual events between time-slots to improve the solution quality. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Kostuch, P. (2005). The university course timetabling problem with a three-phase approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3616 LNCS, pp. 109–125). https://doi.org/10.1007/11593577_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
