A Two Stage Approach for High School Timetabling
There are different types of educational timetabling problems which are computationally difficult to solve. In this study, we deal with the High School Timetabling Problem which requires assignment of events, such as courses, and resources, such as classrooms, to time-slots under a set of different types of constraints. We describe an approach that hybridises an Evolutionary Algorithm variant and Simulated Annealing methods to solve this problem. This approach is tested over a set of real world instances obtained across different countries. The empirical results demonstrate the viability of the hybrid approach when compared to the previously proposed techniques.
KeywordsSoft Constraint Harmony Search Algorithm Timetabling Problem Stage Approach Pitch Adjustment Rate
Unable to display preview. Download preview PDF.
- 6.Domrös, J., Homberger, J.: An evolutionary algorithm for high school timetabling. In: Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), pp. 485–488 (2012)Google Scholar
- 10.Hoang, D.C., Yadav, P., Kumar, R., Panda, S.: A robust harmony search algorithm based clustering protocol for wireless sensor networks. In: 2010 IEEE International Conference on Communications Workshops (ICC), pp. 1–5 (2010)Google Scholar
- 11.Kheiri, A., Özcan, E., Parkes, A.J.: Hysst: Hyper-heuristic search strategies and timetabling. In: Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), pp. 497–499 (2012)Google Scholar
- 12.Kingston, J.H.: A software library for high school timetabling (2009), http://sydney.edu.au/engineering/it/~jeff/khe/
- 15.Minh, K.N.T.T., Thanh, N.D.T., Trang, K.T., Hue, N.T.T.: Using tabu search for solving a high school timetabling problem. In: Nguyen, N.T., Katarzyniak, R., Chen, S.-M. (eds.) Advances in Intelligent Information and Database Systems. SCI, vol. 283, pp. 305–313. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 16.Pillay, N.: A survey of school timetabling research. Annals of Operations Research, 1–33 (2013)Google Scholar
- 17.Post, G.: Benchmarking project for high school timetabling (2011), http://www.utwente.nl/ctit/hstt/
- 19.Post, G., Gaspero, L., Kingston, J.H., McCollum, B., Schaerf, A.: The third international timetabling competition. Annals of Operations Research, 1–7 (2013)Google Scholar
- 20.Sørensen, M., Kristiansen, S., Stidsen, T.R.: International timetabling competition 2011: an adaptive large neighborhood search algorithm. In: Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012). pp. 489–492 (2012)Google Scholar
- 24.Wilke, P., Killer, H.: Walk down jump up algorithm a new hybrid algorithm for timetabling problems. In: Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010), pp. 440–446 (2010)Google Scholar