Conference paper Open Access
Máté Pintér; Balázs Dávid
{ "DOI": "10.26493/978-961-7055-82-5", "author": [ { "family": "M\u00e1t\u00e9 Pint\u00e9r" }, { "family": "Bal\u00e1zs D\u00e1vid" } ], "issued": { "date-parts": [ [ 2019, 10, 10 ] ] }, "abstract": "<p>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.</p>", "title": "A two-stage heuristic for the university course timetabling problem", "note": "Pages 27-30", "type": "paper-conference", "id": "3522620" }
Views | 53 |
Downloads | 48 |
Data volume | 18.1 MB |
Unique views | 52 |
Unique downloads | 47 |