A stochastic local search algorithm with adaptive acceptance for high-school timetabling
Automating high school timetabling is a challenging task. This problem is a well known hard computational problem which has been of interest to practitioners as well as researchers. High schools need to timetable their regular activities once per year, or even more frequently. The exact solvers migh...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Springer
2014
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/32184/ |