Please use this identifier to cite or link to this item:
DC FieldValueLanguage
dc.contributor.authorΓκόγκος, Χρήστοςel_GR
dc.contributor.authorΑλεφραγκής, Παναγιώτηςel_GR
dc.contributor.authorΧούσος, Ευθύμιοςel_GR
dc.description.abstractWe present an approach for the examination timetabling problem as defined in the second International Timetabling Competition ( 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.el_GR
dc.format.extent22 σελ.el_GR
dc.subjectScheduling--Computer programsel_GR
dc.titleA multi-staged algorithmic process for the solution of the examination timetabling problemel_GR
dc.subject.keywordSimulated annealingel_GR
dc.subject.keywordKempe chainsel_GR
dc.subject.keywordInteger programmingel_GR
dc.conference.namePractice and Theory of Automated Timetabling (PATAT 2008), Montrealel_GR
item.fulltextΧωρίς πλήρες κείμενο-
Appears in Collections:Δημοσιεύσεις σε Συνέδρια
Show simple item record

Google ScholarTM


Items in CRIS are protected by copyright, with all rights reserved, unless otherwise indicated.