A two stage approach for high school timetabling

Shambour, Moh'd Khaled Yousef, Khader, Ahamad Tajudin, Kheiri, Ahmed ORCID: https://orcid.org/0000-0002-6716-2130 and Özcan, Ender 2013. A two stage approach for high school timetabling. Presented at: ICONIP 2013: 20th International Conference on Neural Information Processing, Daegu, South Korea, 3-7 November 2013. Published in: Lee, M., Hirose, A., Hou, Z.-G. and Man Kil, R. eds. Neural Information Processing: 20th International Conference, ICONIP 2013, Daegu, Korea, November 3-7, 2013. Proceedings, Part I. Lecture Notes in Computer Science. , vol.8226 Berlin and Heidelberg: Springer, pp. 66-73. 10.1007/978-3-642-42054-2_9

Full text not available from this repository.

Abstract

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.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	L Education > LB Theory and practice of education > LB1603 Secondary Education. High schools Q Science > QA Mathematics
Publisher:	Springer
ISBN:	9783642420542
ISSN:	0302-9743
Last Modified:	31 Oct 2022 10:41
URI:	https://orca.cardiff.ac.uk/id/eprint/85718

Citation Data

Cited 6 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item