Abstract
This paper present the heuristic algorithm that facilitates very efficient creation of personalised timetables for university students. The goal of the algorithm is to find a timetable with the minimal number of event overlaps and at the same time optimizing the length of the stay of the student at university every week. This goal has been achieved by the modular design of the algorithm that gradually constructs the timetable together with pruning the space of remaining options. The results delivered by this algorithm were compared with the results obtained by exhaustive search and it was concluded that our algorithm is able to find the optimal or a very near optimal solution very quickly. Therefore, the algorithm described here can be utilized for the development of the mobile application.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Burke, E.K., Elliman, D.G., Weare, R.F.: A University timetabling system based on graph colouring and constraint manipulation. J. Res. Comput. Educ. 27(1), 1–18 (1994)
Francis, K., Manga, I., Sarjiyus, O.: Scheduling algorithm for university timetabling problem. IOSR J. Comput. Eng. 18(6), 39–43 (2016). Ver. 1
Hussin B., Basari, A.S.H., Shibghatullah, A.S., Asmai, S.A., Othman, N.S.: Exam timetabling using graph colouring approach. In: 2011 IEEE Conference on Open Systems (ICOS), Langkawi, Malaysia, pp. 139–144 (2011)
Lewis, R.: A survey of metaheuristic-based techniques for university timetabling problems. OR Spectr. 30(1), 167–190 (2008)
Nem, S., Kasbon, R., Mean, F.O., Mahamad, S.: Combination-based solution for timetable organizer. In: Proceedings of the WSEAS International Conference. Recent Advances in Computer Engineering Series, vol. 9, pp. 24–28. WSEAS (2013)
Petrovic, S., Burke, E.K.: University timetabling. In: Leung, J. (ed.) The Handbook of Scheduling: Algorithms, Models, and Performance Analysis, chap. 45. CRC Press, Boca Raton (2004)
Abdul-Rahman, S., Burke, E.K., Bargiela, A., McCollum, B., Özcan, E.: A constructive approach to examination timetabling based on adaptive decomposition and ordering. Ann. Oper. Res. 218(1), 3–21 (2014)
Acknowledgment
The support of the Specific Research Project at FIM UHK is gratefully acknowledged.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Cimr, D., Hynek, J. (2018). Heuristic Algorithm for a Personalised Student Timetable. In: Nguyen, N., Pimenidis, E., Khan, Z., Trawiński, B. (eds) Computational Collective Intelligence. ICCCI 2018. Lecture Notes in Computer Science(), vol 11056. Springer, Cham. https://doi.org/10.1007/978-3-319-98446-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-98446-9_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98445-2
Online ISBN: 978-3-319-98446-9
eBook Packages: Computer ScienceComputer Science (R0)