Please use this identifier to cite or link to this item:
|Title:||A multi-staged algorithmic process for the solution of the examination timetabling problem||Authors:||Γκόγκος, Χρήστος
|Keywords:||Scheduling--Computer programs||Issue Date:||Aug-2008||Abstract:||We present an approach for the examination timetabling problem as defined in the second International Timetabling Competition (http://www.cs.qub.ac.uk/itc2007). The solution approach can be considered as an implementation of the GRASP (Greedy Randomized Adaptive Search Procedure) method with the combination of several other metaheuristics. Three stages are employed. The first stage is responsible for the construction of a relatively high quality feasible solution while the second stage improves it using simulated annealing local search. The final stage uses mathematical programming and analyzes each examination period in isolation proposing movements of exams to other rooms resulting in further improvement of the solution quality. The procedure produces feasible solutions for each dataset provided under the runtime limit imposed by the competition’s rules. Results are presented and analyzed.||Description:||http://www.patatconference.org/patat2008/proceedings/Gogos-HC2b.pdf||URI:||http://cris.teiep.gr/jspui/handle/123456789/1295|
|Appears in Collections:||Δημοσιεύσεις σε Συνέδρια|
Show full item record
Items in CRIS are protected by copyright, with all rights reserved, unless otherwise indicated.