Abstract
Solving a real-world university examination timetabling is an intractable problem. Examination timetabling problems (ETP) can be defined as a problem of assigning a set of final examinations schedules to a given number of timeslots and rooms subject to a set of constraints. These constraints are usually divided into hard and soft constraints. Hard constraints must be satisfied under any circumstances. Whilst, soft constraints are not only essential but also should be satisfied as much as possible. Due to the complexity of the problem, it is usually impossible to have solutions that satisfy all soft constraints. The quality of the timetable is measured based on soft constraints violation. A weighted penalty/value is attached to each violation of the soft constraint and the objective is to minimize the total penalty value of these violations. Although there have been a numerous approaches in solving the ETP, but this paper only focus on Genetic Algorithm (GA) method based on the fact that it is robust and can fits into complex problem space. This paper gives a summary of the GA method on ETP and it aims in helping other researcher to shorten their time in understanding the application of GA in the selected problem.
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
References
Carter WM, Laporte G, Lee SY (1996) Examination timetabling: Algorithmic strategies and applications. J Oper Res Soc 47(3):373–383
Cupic M, Golub M, Jakobovic D (2009) Exam timetabling using Genetic Algorithm. In: 31st international conference on information technology interfaces, Cavtat, Croatia, pp 357–362
Holland JH (1992) Adaptation in natural and artificial systems, 2nd edn. The University of Michigan Press, Ann Arbor, MI. MIT Press, Boston, MA
Jha SK (2014) Exam timetabling problem using Genetic Algorithm. Int J Res Eng Tec 3(5):649–654
Mitchell TM (1997) Machine learning. McGraw-Hill Science/Engineering/Math, Redmond, WA
Pham DT, Karaboga D (2000) Intelligent optimisation techniques; Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks. Springer, London
Pillay N, Banzhaf B (2010) An informed Genetic Algorithm for the examination timetabling problem. Appl Soft Comput 10(2010):457–467
Sani HM, Yobo MM (2016) Solving timetabling problems using Genetic Algorithm technique. Int J Comput Appl 134(15):33–38
Wong T, Cote P, Gely P (2002) Final exam timetabling: a practical approach. In: IEEE Canadian Conference on Electrical and Computer Engineering (CCECE 2002), vol 2, IEEE Press, Los Alamitos, pp 726–731
Acknowledgments
We would like to put our gratitude to the Ministry of Education Malaysia for funding money in ‘Research Acculturation Grant Scheme (RAGS) (9018-00085). The funded money will be wisely used to find a solution and solve examination timetabling problem at Universiti Malaysia Perlis.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Adnan, F.A., Ab Saad, S., Yahya, Z.R., Wan Muhamad, W.Z.A. (2018). Genetic Algorithm Method in Examination Timetabling Problem: A Survey. In: Yacob, N., Mohd Noor, N., Mohd Yunus, N., Lob Yussof, R., Zakaria, S. (eds) Regional Conference on Science, Technology and Social Sciences (RCSTSS 2016) . Springer, Singapore. https://doi.org/10.1007/978-981-13-0074-5_88
Download citation
DOI: https://doi.org/10.1007/978-981-13-0074-5_88
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-0073-8
Online ISBN: 978-981-13-0074-5
eBook Packages: Business and ManagementBusiness and Management (R0)