Abstract
To generate a timetable that’s optimal, i.e., with the least possible number of clashes, there is a need for an optimization algorithm. Generating a university timetable that satisfies the constraints is a very arduous and complex process since there are limited slots, rooms, instructors, and sections. Moreover, the constraints and requirements are different for different timetables. It is certain that no university can function without a proper timetable that’s issued at the start of every semester. The purpose of this study is to review a hybrid approach involving Genetic Algorithm and Hill Climbing Algorithm applied to a scheduling problem, such as a university timetable, and to discuss the methodology and findings pertaining to such an approach. Genetic Algorithm is applied to provide a good starting point to the Hill Climbing algorithm. It is further noted that the hybrid approach performed better when applied in comparison to the sole application Genetic Algorithm and Hill Climbing algorithm as it is more efficient and effective respectively.
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
Abdelhalim, E.A., El Khayat, G.A.: A utilization-based genetic algorithm for solving the university timetabling problem (UGA). Alexandria Eng. J. 55(2), 1395–1409 (2016)
Abdulsalaam, S.A., Saddiq, K.: University undergraduate courses timetabling with graph coloring. Abacus (Math. Sci. Ser.) 48(2), 142–150 (2021)
Al-Betar, M.A.: \(\beta \)-hill climbing: an exploratory local search. Neural Comput. Appl. 28(1), 153–168 (2017)
Alghamdi, H., Alsubait, T., Alhakami, H., Baz, A.: A review of optimization algorithms for university timetable scheduling. Eng. Technol. Appl. Sci. Res. 10(6), 6410–6417 (2020)
Aziz, N.L.A., Aizam, N.A.H.: A brief review on the features of university course timetabling problem. In: AIP Conference Proceedings, vol. 2016, no. 1. AIP Publishing (2018)
Burke, E., Jackson, K., Kingston, J.H., Weare, R.: Automated university timetabling: the state of the art. Comput. J. 40(9), 565–571 (1997)
Kieran, E., Petrovic, S.: Recent research directions in automated timetabling. Eur. J. Oper. Res. 140(2), 266–280 (2002)
Dimopoulou, M., Miliotis, P.: Implementation of a university course and examination timetabling system. Eur. J. Oper. Res. 130(1), 202–213 (2001)
György, A., Kocsis, L.: Efficient multi-start strategies for local search algorithms. J. Artif. Intell. Res. 41, 407–444 (2011)
Hambali, A.M., Olasupo, Y.A., Dalhatu, M.: Automated university lecture timetable using heuristic approach. Niger. J. Technol. 39(1), 1–14 (2020)
Herath, A.K.: Genetic algorithm for university course timetabling problem (2017)
Islam, T., Shahriar, Z., Perves, M.A., Hasan, M.: University timetable generator using Tabu search. J. Comput. Commun. 4(16), 28–37 (2016)
Jain, A., Aiyer, G.S.C., Goel, H., Bhandari, R.: A literature review on timetable generation algorithms based on genetic algorithm and heuristic approach. Int. J. Adv. Res. Comput. Commun. Eng. 4(4), 159–163 (2015)
Limota, U., Mujuni, E., Mushi, A.: Solving the university course timetabling problem using bat inspired algorithm. Tanzania J. Sci. 47(2), 674–685 (2021)
Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1998)
Popov, A.: Genetic Algorithms for Optimization-Application in Controller Design Problems. Technical University of Sofia, Hamburg (2005)
Rjoub, A.: Courses timetabling based on hill climbing algorithm. Int. J. Electr. Comput. Eng. (IJECE) 10(6), 6558–6573 (2020)
Selman, B., Gomes, C.P.: Hill-climbing search. Encyclopedia Cogn. Sci. 81, 82 (2006)
Tate, D.M., Smith, A.E., et al.: Expected allele coverage and the role of mutation in genetic algorithms. In: ICGA, vol. 31, p. 37 (1993)
Warke, Y., Munje, D., Swami, A., Raskar, S., Tapkir, G.: Automatic timetable generation using genetic and Hungarian model. Studia Rosenthaliana (J. Study Res.) 12(5), 67–74 (2020)
Willemen, R.J.: School timetable construction: algorithms and complexity. Technical report, Technische Universiteit Eindhoven (2002)
Zhang, H., Ishikawa, M.: An extended hybrid genetic algorithm for exploring a large search space. In: Proceedings of the 2nd International Conference on Autonomous Robots and Agents, pp. 244–248. Citeseer (2004)
Zhang, L., Lau, S.: Constructing university timetable using constraint satisfaction programming approach. In: International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC 2006), vol. 2, pp. 55–60. IEEE (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Hussain, A., Ashas, H., Shahid, A., Qureshi, S., Karrila, S. (2024). Hybrid Approach Involving Genetic Algorithm and Hill Climbing to Resolve the Timetable Scheduling for a University. In: Arai, K. (eds) Advances in Information and Communication. FICC 2024. Lecture Notes in Networks and Systems, vol 919. Springer, Cham. https://doi.org/10.1007/978-3-031-53960-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-53960-2_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-53959-6
Online ISBN: 978-3-031-53960-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)