Talks and Poster Presentations (with Proceedings-Entry):
M. Pimmer, G. Raidl:
"A timeslot-filling based heuristic approach to construct high-school timetables";
Talk: Metaheuristic International Conference (MIC),
- 2011-07-28; in: "Proceedings of the 9th Metaheuristics International Conference",
This work describes an approach for creating high-school timetables. To develop and test our
algorithm, we used the international, real-world instances of the Benchmarking project for (High)
School Timetabling. Contrary to most other heuristic approaches, we do not try to iteratively assign
single meetings (events) to timeslots. Instead, we repeatedly choose a not entirely occupied timeslot
and aim at simultaneously assigning the most suitable set of meetings. To improve and diversify
the solutions, a heuristic that deletes and reassigns certain timeslots, events or resources is applied
and combined with a hill-climbing procedure to find suitable parameters for grading constraints.
Experimental results indicate the competitiveness of this new approach.
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.