{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:31:33Z","timestamp":1776443493412,"version":"3.51.2"},"reference-count":74,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T00:00:00Z","timestamp":1690243200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Science and Higher Education of the Russian Federation","award":["075-15-2022-1121"],"award-info":[{"award-number":["075-15-2022-1121"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>The university course timetable problem (UCTP) is known to be NP-hard, with solution complexity growing exponentially with the problem size. This paper introduces an algorithm that effectively tackles UCTPs by employing a combination of exploration and exploitation strategies. The algorithm comprises two main components. Firstly, it utilizes a genetic algorithm (GA) to explore the search space and discover a solution within the global optimum region. Secondly, it enhances the solution by exploiting the region using an iterated local search (ILS) algorithm. The algorithm is tested on two common variants of UCTP: the post-enrollment-based course timetable problem (PE-CTP) and the curriculum-based course timetable problem (CB-CTP). The computational results demonstrate that the proposed algorithm yields competitive outcomes when compared empirically against other existing algorithms. Furthermore, a t-test comparison with state-of-the-art algorithms is conducted. The experimental findings also highlight that the hybrid approach effectively overcomes the limitation of local optima, which is encountered when solely employing GA in conjunction with local search.<\/jats:p>","DOI":"10.3390\/axioms12080720","type":"journal-article","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T01:09:01Z","timestamp":1690333741000},"page":"720","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Exploration and Exploitation-Based Metaheuristic Approach for University Course Timetabling Problems"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4383-6652","authenticated-orcid":false,"given":"Rakesh P.","family":"Badoni","sequence":"first","affiliation":[{"name":"Department of Mathematics, \u00c9cole Centrale School of Engineering, Mahindra University, Hyderabad 500043, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4514-3916","authenticated-orcid":false,"given":"Jayakrushna","family":"Sahoo","sequence":"additional","affiliation":[{"name":"Department of Computer Science & Engineering, Indian Institute of Information Technology Kottayam, Kottayam 686635, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0026-4471","authenticated-orcid":false,"given":"Shwetabh","family":"Srivastava","sequence":"additional","affiliation":[{"name":"CMP Degree College, University of Allahabad, Prayagraj 211002, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mukesh","family":"Mann","sequence":"additional","affiliation":[{"name":"Department of Computer Science & Engineering, Indian Institute of Information Technology, Sonepat 131029, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. K.","family":"Gupta","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Kharagpur, Kharagpur 721302, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swati","family":"Verma","sequence":"additional","affiliation":[{"name":"CSIR-National Institute of Oceanography, Panaji 403004, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0655-3741","authenticated-orcid":false,"given":"Predrag S.","family":"Stanimirovi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Sciences and Mathematics, University of Ni\u0161, 18000 Ni\u0161, Serbia"},{"name":"Laboratory \u201cHybrid Methods of Modelling and Optimization in Complex Systems\u201d, Siberian Federal University, Prosp. Svobodny 79, 660041 Krasnoyarsk, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0667-4001","authenticated-orcid":false,"given":"Lev A.","family":"Kazakovtsev","sequence":"additional","affiliation":[{"name":"Laboratory \u201cHybrid Methods of Modelling and Optimization in Complex Systems\u201d, Siberian Federal University, Prosp. Svobodny 79, 660041 Krasnoyarsk, Russia"},{"name":"Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarskiy Rabochiy Av., 660037 Krasnoyarsk, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5308-2503","authenticated-orcid":false,"given":"Darjan","family":"Karaba\u0161evi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Applied Management, Economics and Finance, University Business Academy in Novi Sad, Jevrejska 24, 11000 Belgrade, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,7,25]]},"reference":[{"key":"ref_1","unstructured":"Wren, A. (1996). Practice and theory of automated timetabling, Springer."},{"key":"ref_2","unstructured":"Di Gaspero, L., McCollum, B., and Schaerf, A. (2007). The Second International Timetabling Competition (ITC-2007): Curriculum-Based Course Timetabling (Track 3), Queen\u2019s University. Technical Report, QUB\/IEEE\/Tech\/ITC2007\/CurriculumCTT\/v1.0."},{"key":"ref_3","unstructured":"Gotlieb, C. (September, January 27). The construction of class-teacher timetables. Proceedings of the International Federation of Information Processing Congress, Munich, Germany."},{"key":"ref_4","unstructured":"Carter, M.W., and Laporte, G. (1998). Practice and Theory of Automated Timetabling II, Springer."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10951-006-8495-8","article-title":"An effective hybrid algorithm for university course timetabling","volume":"9","author":"Chiarandini","year":"2006","journal-title":"J. Sched."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10951-010-0202-0","article-title":"A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling","volume":"14","author":"Jat","year":"2011","journal-title":"J. Sched."},{"key":"ref_7","unstructured":"Socha, K., Knowles, J., and Sampels, M. (2002). Ant Algorithms, Springer."},{"key":"ref_8","unstructured":"Rossi-Doria, O., Sampels, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardella, L.M., Knowles, J., Manfrin, M., Mastrolilli, M., and Paechter, B. (2003). Practice and Theory of Automated Timetabling IV, Springer."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","article-title":"A tabu-search hyperheuristic for timetabling and rostering","volume":"9","author":"Burke","year":"2003","journal-title":"J. Heuristics"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","article-title":"A graph-based hyper-heuristic for educational timetabling problems","volume":"176","author":"Burke","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_11","first-page":"2516","article-title":"Adaptive randomized descent algorithm for solving course timetabling problems","volume":"5","author":"Abuhamdah","year":"2010","journal-title":"Int. J. Phys. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-010-0769-z","article-title":"A harmony search algorithm for university course timetabling","volume":"194","author":"Khader","year":"2012","journal-title":"Ann. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10479-010-0737-7","article-title":"Local search and constraint programming for the post enrolment-based course timetabling problem","volume":"194","author":"Cambazard","year":"2012","journal-title":"Ann. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/s10489-013-0444-6","article-title":"Population based Local Search for university course timetabling problems","volume":"40","author":"Abuhamdah","year":"2014","journal-title":"Appl. Intell."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.cor.2016.06.018","article-title":"An ILP based heuristic for a generalization of the post-enrollment course timetabling problem","volume":"76","author":"Zabala","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1080\/01605682.2018.1468862","article-title":"Simulated annealing with improved reheating and learning for the post enrolment course timetabling problem","volume":"70","author":"Goh","year":"2019","journal-title":"J. Oper. Res. Soc."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","article-title":"Metaheuristics in combinatorial optimization: Overview and conceptual comparison","volume":"35","author":"Blum","year":"2003","journal-title":"Acm Comput. Surv. (CSUR)"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Abdullah, S., and Turabieh, H. (2008, January 11\u201313). Generating university course timetable using genetic algorithms and local search. Proceedings of the Third International Conference on Convergence and Hybrid Information Technology (ICCIT\u201908), Busan, Republic of Korea.","DOI":"10.1109\/ICCIT.2008.379"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Abdullah, S., Burke, E.K., and McCollum, B. (2007, January 25\u201328). A hybrid evolutionary approach to the university course timetabling problem. Proceedings of the 2007 IEEE Congress on Evolutionary Computation, Singapore.","DOI":"10.1109\/CEC.2007.4424686"},{"key":"ref_20","unstructured":"Jat, S.N., and Yang, S. (2009, January 10\u201312). A guided search genetic algorithm for the university course timetabling problem. Proceedings of the Multidisciplinary International Conference on Scheduling: Theory and Applications IV, Dublin, Ireland."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TSMCC.2010.2049200","article-title":"Genetic algorithms with guided and local search strategies for university course timetabling","volume":"41","author":"Yang","year":"2011","journal-title":"IEEE Trans. Syst. Man Cybern. Part Appl. Rev."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10732-010-9154-y","article-title":"A hybrid metaheuristic approach to the university course timetabling problem","volume":"18","author":"Abdullah","year":"2012","journal-title":"J. Heuristics"},{"key":"ref_23","unstructured":"Shaker, K., Abdullah, S., Alqudsi, A., and Jalab, H. (2013). Rough Sets and Knowledge Technology, Springer."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cie.2014.09.020","article-title":"A new hybrid algorithm for university course timetabling problem using events based on groupings of students","volume":"78","author":"Badoni","year":"2014","journal-title":"Comput. Ind. Eng."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1109\/TEVC.2015.2411741","article-title":"A hybrid swarm-based approach to university timetabling","volume":"19","author":"Fong","year":"2015","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_26","unstructured":"Unprasertporn, T., and Lohpetch, D. (February, January 29). An Outperforming Hybrid Discrete Particle Swarm Optimization for Solving the Timetabling Problem. Proceedings of the 12th International Conference on Knowledge and Smart Technology (KST\u201920), Pattaya, Thailand."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10489-020-01833-x","article-title":"A hybrid algorithm for the university course timetabling problem using the improved parallel genetic algorithm and local search","volume":"51","author":"Rezaeipanah","year":"2021","journal-title":"Appl. Intell."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"106515","DOI":"10.1109\/ACCESS.2021.3100613","article-title":"A survey of university course timetabling problem: Perspectives, trends and opportunities","volume":"9","author":"Chen","year":"2021","journal-title":"IEEE Access"},{"key":"ref_29","unstructured":"Atsuta, M., Nonobe, K., and Ibaraki, T. (2008, January 19\u201322). ITC2007 Track2: An Approach Using General CSP solver. Proceedings of the Practice and Theory of Automated Timetabling (PATAT 2008), Montreal, QC, Canada."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.cor.2015.07.002","article-title":"Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem","volume":"65","author":"Bellio","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10479-010-0700-7","article-title":"Curriculum based course timetabling: New solutions to Udine benchmark instances","volume":"194","author":"Lach","year":"2012","journal-title":"Ann. Oper. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.ejor.2008.12.007","article-title":"Adaptive tabu search for course timetabling","volume":"200","author":"Hao","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10479-017-2625-x","article-title":"Automated generation of constructive ordering heuristics for educational timetabling","volume":"275","author":"Pillay","year":"2019","journal-title":"Ann. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1504\/IJMOR.2014.059537","article-title":"A new approach for university timetabling problems","volume":"6","author":"Badoni","year":"2014","journal-title":"Int. J. Math. Oper. Res."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","article-title":"ITC2007 solver description: A hybrid approach","volume":"172","year":"2009","journal-title":"Ann. Oper. Res."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Azlan, A., and Hussin, N.M. (2013, January 7\u20139). Implementing graph coloring heuristic in construction phase of curriculum-based course timetabling problem. Proceedings of the 2013 IEEE Symposium on Computers & Informatics (ISCI), Langkawi, Malaysia.","DOI":"10.1109\/ISCI.2013.6612369"},{"key":"ref_37","first-page":"45","article-title":"SAT Model for the Curriculum-Based Course Timetabling Problem","volume":"68","year":"2013","journal-title":"Adv. Soft Comput. Tech."},{"key":"ref_38","first-page":"365","article-title":"Harmony Search Algorithm for Curriculum-Based Course Timetabling Problem","volume":"3","author":"Wahid","year":"2013","journal-title":"Int. J. Soft Comput. Softw. Eng."},{"key":"ref_39","unstructured":"Clark, M., Henz, M., and Love, B. (2008, January 18\u201322). Quikfix a Repair-Based Timetable Solver. Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling, PATAT, Montr\u00e9al, QC, Canada. Available online: http:\/\/www.comp.nus.edu.sg\/~henz\/publications\/ps\/PATAT2008.pdf."},{"key":"ref_40","unstructured":"Leung, J. (2004). Handbook of Scheduling: Algorithms, Models, and Performance Analysis, CRC Press. Chapter 45."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Junaedi, D., and Maulidevi, N.U. (2011, January 12\u201314). Solving Curriculum-Based Course Timetabling Problem with Artificial Bee Colony Algorithm. Proceedings of the First International Conference on Informatics and Computational Intelligence (ICI), Bandung, Indonesia.","DOI":"10.1109\/ICI.2011.28"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Agahian, S., Pehlivan, H., and Dehkharghani, R. (2014, January 27\u201329). Adaptation and Use of Artificial Bee Colony Algorithm to Solve Curriculum-based Course Time-Tabling Problem. Proceedings of the Fifth International Conference on Intelligent Systems, Modelling and Simulation (ISMS), Langkawi, Malaysia.","DOI":"10.1109\/ISMS.2014.157"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.cor.2017.09.007","article-title":"A bi-criteria hybrid Genetic Algorithm with robustness objective for the course timetabling problem","volume":"90","author":"Akkan","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-018-2757-7","article-title":"teaspoon: Solving the curriculum-based course timetabling problems with answer set programming","volume":"275","author":"Banbara","year":"2019","journal-title":"Ann. Oper. Res."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"107624","DOI":"10.1016\/j.asoc.2021.107624","article-title":"Competition-guided multi-neighborhood local search algorithm for the university course timetabling problem","volume":"110","author":"Song","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_46","first-page":"200253","article-title":"Meta-heuristic approaches for the University Course Timetabling Problem","volume":"19","author":"Abdipoor","year":"2023","journal-title":"Intell. Syst. Appl."},{"key":"ref_47","unstructured":"Papadimitriou, C.H., and Steiglitz, K. (1998). Combinatorial Optimization: Algorithms and Complexity, Courier Dover Publications."},{"key":"ref_48","unstructured":"Golberg, D.E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning, Addion Wesley."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0003-2670(03)00753-0","article-title":"Hybrid genetic algorithm\u2013Tabu search approach for optimising multilayer optical coatings","volume":"490","author":"Hageman","year":"2003","journal-title":"Anal. Chim. Acta"},{"key":"ref_50","unstructured":"Fatourechi, M., Bashashati, A., Ward, R.K., and Birch, G.E. (2005, January 23). A hybrid genetic algorithm approach for improving the performance of the LF-ASD brain computer interface. Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Philadelphia, PA, USA."},{"key":"ref_51","unstructured":"Sastry, K., Goldberg, D., and Kendall, G. (2005). Search Methodologies, Springer."},{"key":"ref_52","unstructured":"Datta, D., Deb, K., and Fonseca, C.M. (2007). Evolutionary Scheduling, Springer."},{"key":"ref_53","first-page":"321","article-title":"Iterated Local Search","volume":"57","author":"Martin","year":"2002","journal-title":"Sci. Kluwer"},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Turabieh, H., and Abdullah, S. (2009, January 27\u201328). Incorporating tabu search into memetic approach for enrolment-based course timetabling problems. Proceedings of the Second Conference on Data Mining and Optimization (DMO\u201909), Kajand, Malaysia.","DOI":"10.1109\/DMO.2009.5341901"},{"key":"ref_55","unstructured":"Abdullah, S., Burke, E.K., and McCollum, B. (2007). Metaheuristics, Springer."},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Mcmullan, P. (2007, January 27\u201330). An extended implementation of the great deluge algorithm for course timetabling. Proceedings of the International Conference on Computational Science (ICCS\u201907), Beijing, China.","DOI":"10.1007\/978-3-540-72584-8_71"},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Landa-Silva, D., and Obit, J.H. (2008, January 6\u20138). Great deluge with non-linear decay rate for solving course timetabling problems. Proceedings of the Fourth International Conference on Intelligent Systems (IS\u201908), Varna, Bulgaria.","DOI":"10.1109\/IS.2008.4670447"},{"key":"ref_58","unstructured":"Obit, J., Landa-Silva, D., Ouelhadj, D., and Sevaux, M. (2009, January 13\u201316). Non-linear great deluge with learning mechanism for solving the course timetabling problem. Proceedings of the Eighth Metaheuristics International Conference (MIC\u201909), Hamburg, Germany."},{"key":"ref_59","unstructured":"Turabieh, H., Abdullah, S., McCollum, B., and McMullan, P. (2010). Rough Set and Knowledge Technology, Springer."},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Abuhamdah, A., and Ayob, M. (2011, January 28\u201329). MPCA-ARDA for solving course timetabling problems. Proceedings of the Third Conference on Data Mining and Optimization (DMO\u201911), Putrajaya, Malaysia.","DOI":"10.1109\/DMO.2011.5976523"},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/j.jocs.2014.04.002","article-title":"University course timetabling using hybridized artificial bee colony with hill climbing optimizer","volume":"5","author":"Bolaji","year":"2014","journal-title":"J. Comput. Sci."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2014.05.039","article-title":"A new hybrid imperialist swarm-based optimization algorithm for university timetabling problems","volume":"283","author":"Fong","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1109\/TSMCC.2011.2174356","article-title":"University course timetabling using a hybrid harmony search metaheuristic algorithm","volume":"42","author":"Khader","year":"2012","journal-title":"IEEE Trans. Syst. Man Cybern. Part Appl. Rev."},{"key":"ref_64","unstructured":"Lohpetch, D., and Jaengchuea, S. (2016). Recent Advances in Information and Communication Technology 2016, Springer."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10479-010-0703-4","article-title":"Applying the threshold accepting metaheuristic to curriculum based course timetabling","volume":"194","author":"Geiger","year":"2012","journal-title":"Ann. Oper. Res."},{"key":"ref_66","unstructured":"De Cesco, F., Di Gaspero, L., and Schaerf, A. (2008, January 18\u201322). Benchmarking Curriculum-Based Course Timetabling: Formulations, Data Formats, Instances, Validation, and Results. Proceedings of the 7th international Conference on the Practice and Theory of Automated Timetabling, PATAT, Montr\u00e9al, QC, Canada."},{"key":"ref_67","unstructured":"Lach, G., and L\u00fcbbecke, M. (2008, January 18\u201322). Curriculum based course timetabling: Optimal solutions to the udine benchmark instances. Proceedings of the Seventh International Conference on the Practice and Theory of Automated Timetabling, Montr\u00e9al, QC, Canada."},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.ins.2011.12.018","article-title":"On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems","volume":"191","author":"Abdullah","year":"2012","journal-title":"Inf. Sci."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10951-011-0224-2","article-title":"Design and statistical analysis of a hybrid local search algorithm for course timetabling","volume":"15","author":"Bellio","year":"2012","journal-title":"J. Sched."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10479-018-3096-4","article-title":"Flow formulations for curriculum-based course timetabling","volume":"280","author":"Bagger","year":"2019","journal-title":"Ann. Oper. Res."},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10479-016-2151-2","article-title":"Adaptive large neighborhood search for the curriculum-based course timetabling problem","volume":"252","author":"Kiefer","year":"2017","journal-title":"Ann. Oper. Res."},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1002\/tee.23067","article-title":"Solving university course timetabling problem using localized island model genetic algorithm with dual dynamic migration policy","volume":"15","author":"Gozali","year":"2020","journal-title":"IEEJ Trans. Electr. Electron. Eng."},{"key":"ref_73","doi-asserted-by":"crossref","unstructured":"Kazakovtsev, L.A., Gudyma, M.N., and Antamoshkin, A.N. (2014, January 6\u20138). Genetic Algorithm with Greedy Heuristic for Capacity Planning. Proceedings of the International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, St. Petersburg, Russia.","DOI":"10.1109\/ICUMT.2014.7002170"},{"key":"ref_74","first-page":"993","article-title":"A genetic algorithm with greedy crossover and elitism for capacity planning","volume":"37","author":"Kazakovtsev","year":"2023","journal-title":"Facta Univ. Ser. Math. Inform."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/8\/720\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:18:45Z","timestamp":1760127525000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/8\/720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,25]]},"references-count":74,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2023,8]]}},"alternative-id":["axioms12080720"],"URL":"https:\/\/doi.org\/10.3390\/axioms12080720","relation":{},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,25]]}}}