A Timeslot-Filling Heuristic Approach to Construct High-School Timetables [chapter]

Michael Pimmer, Günther R. Raidl
2013 Operations Research/Computer Science Interfaces Series  
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
more » ... 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.
doi:10.1007/978-1-4614-6322-1_9 fatcat:h3nmynssvbcwtexqir6u3dvtr4