Conference paper Open Access
Máté Pintér; Balázs Dávid
This paper presents a two-stage solution method for the curriculum-based university course timetabling problem. First, an initial solution is created using a recursive search algorithm, then its quality is improved with a local search heuristic. This method utilizes a tabu list of forbidden transformations, as well as a destructive step at the end of each iteration. The algorithm is tested on datasets of the 2007 International Timetabling Competition.
Name | Size | |
---|---|---|
A two-stage heuristic.pdf
md5:6a9ef24d369a4ad3df310e7faecc5f12 |
377.8 kB | Download |
Views | 126 |
Downloads | 101 |
Data volume | 38.2 MB |
Unique views | 122 |
Unique downloads | 99 |