{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:35:16Z","timestamp":1776976516826,"version":"3.51.4"},"reference-count":150,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T00:00:00Z","timestamp":1674086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T00:00:00Z","timestamp":1674086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Research Council of Thailand and Naresuan University","award":["N42A650329"],"award-info":[{"award-number":["N42A650329"]}]},{"name":"Ministry of Higher Education, Science, Research and Innovation","award":["RGNS 63-204"],"award-info":[{"award-number":["RGNS 63-204"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s00500-022-07810-5","type":"journal-article","created":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T17:05:18Z","timestamp":1674147918000},"page":"9735-9772","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Modified and hybridised bi-objective firefly algorithms for university course scheduling"],"prefix":"10.1007","volume":"27","author":[{"given":"Thatchai","family":"Thepphakorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8059-8852","authenticated-orcid":false,"given":"Pupong","family":"Pongcharoen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"7810_CR1","doi-asserted-by":"publisher","first-page":"103282","DOI":"10.1016\/j.advengsoft.2022.103282","volume":"174","author":"B Abdollahzadeh","year":"2022","unstructured":"Abdollahzadeh B, Gharehchopogh FS, Khodadadi N, Mirjalili S (2022) Mountain gazelle optimizer: a new nature-inspired metaheuristic algorithm for global optimization problems. Adv Eng Softw 174:103282","journal-title":"Adv Eng Softw"},{"key":"7810_CR2","doi-asserted-by":"publisher","first-page":"107408","DOI":"10.1016\/j.cie.2021.107408","volume":"158","author":"B Abdollahzadeh","year":"2021","unstructured":"Abdollahzadeh B, Gharehchopogh FS, Mirjalili S (2021a) African vultures optimization algorithm: a new nature-inspired metaheuristic algorithm for global optimization problems. Comput Ind Eng 158:107408","journal-title":"Comput Ind Eng"},{"issue":"10","key":"7810_CR3","doi-asserted-by":"publisher","first-page":"5887","DOI":"10.1002\/int.22535","volume":"36","author":"B Abdollahzadeh","year":"2021","unstructured":"Abdollahzadeh B, Soleimanian Gharehchopogh F, Mirjalili S (2021b) Artificial gorilla troops optimizer: a new nature-inspired metaheuristic algorithm for global optimization problems. Int J Intell Syst 36(10):5887\u20135958","journal-title":"Int J Intell Syst"},{"issue":"2","key":"7810_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.21123\/bsj.2022.19.2.0399","volume":"19","author":"IA Abduljabbar","year":"2022","unstructured":"Abduljabbar IA, Abdullah SM (2022) An evolutionary algorithm for solving academic courses timetable scheduling problem. Baghdad Sci J 19(2):399\u2013408","journal-title":"Baghdad Sci J"},{"issue":"1","key":"7810_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-010-9154-y","volume":"18","author":"S Abdullah","year":"2012","unstructured":"Abdullah S, Turabieh H, McCollum B, McMullan P (2012) A hybrid metaheuristic approach to the university course timetabling problem. J Heurist 18(1):1\u201323","journal-title":"J Heurist"},{"issue":"1","key":"7810_CR6","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s10489-013-0444-6","volume":"40","author":"A Abuhamdah","year":"2014","unstructured":"Abuhamdah A, Ayob M, Kendall G, Sabar NR (2014) Population based Local Search for university course timetabling problems. Appl Intell 40(1):44\u201353","journal-title":"Appl Intell"},{"key":"7810_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.cor.2017.09.007","volume":"90","author":"C Akkan","year":"2018","unstructured":"Akkan C, G\u00fclc\u00fc A (2018) A bi-criteria hybrid Genetic Algorithm with robustness objective for the course timetabling problem. Comput Oper Res 90:22\u201332","journal-title":"Comput Oper Res"},{"issue":"1","key":"7810_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-010-0769-z","volume":"194","author":"MA Al-Betar","year":"2012","unstructured":"Al-Betar MA, Khader AT (2012) A harmony search algorithm for university course timetabling. Ann Oper Res 194(1):3\u201331","journal-title":"Ann Oper Res"},{"key":"7810_CR9","unstructured":"Al-Betar MA, Khader AT, Gani TA (2008) A harmony search algorithm for university course timetabling. In: Proceedings of the 7th international conference on the practice and theory of automated timetabling, PATAT 2008, Canada, 19\u201322 August 2008"},{"issue":"5","key":"7810_CR10","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1109\/TSMCC.2011.2174356","volume":"42","author":"MA Al-Betar","year":"2012","unstructured":"Al-Betar MA, Khader AT, Zaman M (2012) University course timetabling using a hybrid harmony search metaheuristic algorithm. IEEE Trans Syst Man Cybern Part C\u2014Appl Rev 42(5):664\u2013681","journal-title":"IEEE Trans Syst Man Cybern Part C\u2014Appl Rev"},{"issue":"3","key":"7810_CR11","doi-asserted-by":"publisher","first-page":"032053","DOI":"10.1088\/1757-899X\/928\/3\/032053","volume":"928","author":"WA Algasm","year":"2020","unstructured":"Algasm WA (2020) Hybrid algorithm to solve timetabling problem. IOP Confer Ser: Mater Sci Eng 928(3):032053","journal-title":"IOP Confer Ser: Mater Sci Eng"},{"key":"7810_CR12","doi-asserted-by":"crossref","unstructured":"Alirezaei E, Vahedi Z, Ghaznavi-Ghoushchi M (2012) Parallel hybrid meta heuristic algorithm for university course timetabling problem (PHACT). In: Proceedings of the 20th Iranian conference on electrical engineering (ICEE 2012), Iran, 15\u201317 May 2012, pp 673\u2013678","DOI":"10.1109\/IranianCEE.2012.6292439"},{"issue":"4","key":"7810_CR13","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1016\/j.cor.2007.12.007","volume":"36","author":"H Asmuni","year":"2009","unstructured":"Asmuni H, Burke EK, Garibaldi JM, McCollum B, Parkes AJ (2009) An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables. Comput Oper Res 36(4):981\u20131001","journal-title":"Comput Oper Res"},{"key":"7810_CR14","doi-asserted-by":"publisher","unstructured":"Austero LD, Sison AM, Matias JB, Medina RP (2022) Solving course timetabling problem using Whale Optimization Algorithm. In: Proceedings of the 8th international conference on Information Technology Trends (ITT 2022), Dubai, United Arab Emirates, 25\u201326 May 2022, pp 160\u2013166. https:\/\/doi.org\/10.1109\/ITT56123.2022.9863951","DOI":"10.1109\/ITT56123.2022.9863951"},{"issue":"1","key":"7810_CR15","first-page":"168","volume":"31","author":"FH Awad","year":"2022","unstructured":"Awad FH, Al-Kubaisi A, Mahmood M (2022) Large-scale timetabling problems with adaptive tabu search. J Intell Syst 31(1):168\u2013176","journal-title":"J Intell Syst"},{"key":"7810_CR16","doi-asserted-by":"publisher","first-page":"6755","DOI":"10.1007\/s00500-016-2225-8","volume":"21","author":"RA Aziz","year":"2016","unstructured":"Aziz RA, Ayob M, Othman Z, Ahmad Z, Sabar NR (2016) An adaptive guided variable neighborhood search based on honey-bee mating optimization algorithm for the course timetabling problem. Soft Comput 21:6755\u20136765","journal-title":"Soft Comput"},{"key":"7810_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cie.2014.11.010","volume":"86","author":"H Babaei","year":"2015","unstructured":"Babaei H, Karimpour J, Hadidi A (2015) A survey of approaches for university course timetabling problem. Comput Ind Eng 86:43\u201359","journal-title":"Comput Ind Eng"},{"key":"7810_CR18","doi-asserted-by":"crossref","unstructured":"Badoni RP, Gupta DK (2016) A new algorithm based on students groupings for university course timetabling problem. In: Proceedings of the 2nd international conference on recent advances in engineering and computational sciences (RAECS 2015), India, 21\u201322 December 2015, p 7453340","DOI":"10.1109\/RAECS.2015.7453340"},{"key":"7810_CR19","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cie.2014.09.020","volume":"78","author":"RP Badoni","year":"2014","unstructured":"Badoni RP, Gupta DK, Mishra P (2014) A new hybrid algorithm for university course timetabling problem using events based on groupings of students. Comput Ind Eng 78:12\u201325","journal-title":"Comput Ind Eng"},{"key":"7810_CR20","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cor.2015.07.002","volume":"65","author":"R Bellio","year":"2016","unstructured":"Bellio R, Ceschia S, Di Gaspero L, Schaerf A, Urli T (2016) Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Comput Oper Res 65:83\u201392","journal-title":"Comput Oper Res"},{"key":"7810_CR21","doi-asserted-by":"crossref","unstructured":"Bolaji AL, Khader AT, Al-Betar MA, Awadallah MA (2013) A modified artificial bee colony algorithm for post-enrolment course timetabling. In: Lecture notes in computer science, 7928 LNCS, pp 377\u2013386","DOI":"10.1007\/978-3-642-38703-6_45"},{"issue":"5","key":"7810_CR22","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.jocs.2014.04.002","volume":"5","author":"AL Bolaji","year":"2014","unstructured":"Bolaji AL, Khader AT, Al-Betar MA, Awadallah MA (2014) University course timetabling using hybridized artificial bee colony with hill climbing optimizer. J Comput Sci 5(5):809\u2013818","journal-title":"J Comput Sci"},{"key":"7810_CR23","doi-asserted-by":"crossref","unstructured":"Budiono TA, Wong KW (2011) Memetic algorithm behavior on timetabling infeasibility. In: Proceedings of the IEEE region 10 annual international conference (TENCON 2011), Indonesia, 21\u201324 November 2011, pp 93\u201397","DOI":"10.1109\/TENCON.2011.6129070"},{"issue":"2","key":"7810_CR24","doi-asserted-by":"publisher","first-page":"139","DOI":"10.2298\/YJOR0302139B","volume":"13","author":"E Burke","year":"2003","unstructured":"Burke E, Bykov Y, Newall J, Petrovic S (2003) A time-predefined approach to course timetabling. Yugoslav J Oper Res 13(2):139\u2013151","journal-title":"Yugoslav J Oper Res"},{"issue":"3","key":"7810_CR25","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.cor.2009.02.023","volume":"37","author":"EK Burke","year":"2010","unstructured":"Burke EK, Marecek J, Parkes AJ, Rudova H (2010) Decomposition, reformulation, and diving in university course timetabling. Comput Oper Res 37(3):582\u2013597","journal-title":"Comput Oper Res"},{"issue":"1","key":"7810_CR26","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"EK Burke","year":"2007","unstructured":"Burke EK, McCollum B, Meisels A, Petrovic S, Qu R (2007) A graph-based hyper-heuristic for educational timetabling problems. Eur J Oper Res 176(1):177\u2013192","journal-title":"Eur J Oper Res"},{"issue":"1\u20134","key":"7810_CR27","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/B:ANOR.0000030684.30824.08","volume":"129","author":"EK Burke","year":"2004","unstructured":"Burke EK, Newall JP (2004) Solving examination timetabling problems through adaption of heuristic orderings. Ann Oper Res 129(1\u20134):107\u2013134","journal-title":"Ann Oper Res"},{"issue":"1","key":"7810_CR28","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10479-010-0737-7","volume":"194","author":"H Cambazard","year":"2012","unstructured":"Cambazard H, Hebrard E, O\u2019Sullivan B, Papadopoulos A (2012) Local search and constraint programming for the post enrolment-based course timetabling problem. Ann Oper Res 194(1):111\u2013135","journal-title":"Ann Oper Res"},{"issue":"7","key":"7810_CR29","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.cor.2011.09.014","volume":"39","author":"S Ceschia","year":"2012","unstructured":"Ceschia S, Di Gaspero L, Schaerf A (2012) Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Comput Oper Res 39(7):1615\u20131624","journal-title":"Comput Oper Res"},{"issue":"4","key":"7810_CR30","first-page":"26","volume":"15","author":"A Chainual","year":"2007","unstructured":"Chainual A, Lutuksin T, Pongcharoen P (2007) Computer based scheduling tool for multi-product scheduling problems. Int J Comput, Internet Manag 15(4):26\u201331","journal-title":"Int J Comput, Internet Manag"},{"key":"7810_CR31","first-page":"475","volume":"10","author":"A Chakraborty","year":"2017","unstructured":"Chakraborty A, Kar AK (2017) Swarm intelligence: a review of algorithms. Model Optim Sci Technol 10:475\u2013494","journal-title":"Model Optim Sci Technol"},{"issue":"21","key":"7810_CR32","doi-asserted-by":"publisher","first-page":"6705","DOI":"10.1080\/00207543.2018.1471240","volume":"57","author":"S Chansombat","year":"2019","unstructured":"Chansombat S, Musikapun P, Pongcharoen P, Hicks C (2019) A hybrid discrete bat algorithm with krill herd-based advanced planning and scheduling tool for the capital goods industry. Int J Prod Res 57(21):6705\u20136726","journal-title":"Int J Prod Res"},{"issue":"10","key":"7810_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/math8101833","volume":"8","author":"O Ch\u00e1vez-Bosquez","year":"2020","unstructured":"Ch\u00e1vez-Bosquez O, Hern\u00e1ndez-Torruco J, Hern\u00e1ndez-Oca\u00f1a B, Canul-Reich J (2020) Modeling and solving a Latin American university course timetabling problem instance. Mathematics 8(10):1\u201329","journal-title":"Mathematics"},{"issue":"2","key":"7810_CR34","doi-asserted-by":"publisher","first-page":"227","DOI":"10.3390\/a6020227","volume":"6","author":"R-M Chen","year":"2013","unstructured":"Chen R-M, Shih H-F (2013) Solving university course timetabling problems using constriction particle swarm optimization with local search. Algorithms 6(2):227\u2013244","journal-title":"Algorithms"},{"issue":"5","key":"7810_CR35","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10951-006-8495-8","volume":"9","author":"M Chiarandini","year":"2006","unstructured":"Chiarandini M, Birattari M, Socha K, Rossi-Doria O (2006) An effective hybrid algorithm for university course timetabling. J Sched 9(5):403\u2013432","journal-title":"J Sched"},{"key":"7810_CR36","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.asoc.2017.07.053","volume":"61","author":"H Chiroma","year":"2017","unstructured":"Chiroma H, Herawan T, Fister I, Fister I, Abdulkareem S, Shuib L et al (2017) Bio-inspired computation: recent development on the modifications of the cuckoo search algorithm. Appl Soft Comput 61:149\u2013173","journal-title":"Appl Soft Comput"},{"key":"7810_CR37","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-3-319-18476-0_27","volume":"347","author":"B Crawford","year":"2015","unstructured":"Crawford B, Soto R, Johnson F, Paredes F (2015) A timetabling applied case solved with ant colony optimization. Adv Intell Syst Comput 347:267\u2013276","journal-title":"Adv Intell Syst Comput"},{"issue":"2","key":"7810_CR38","first-page":"542","volume":"12","author":"MH Cruz-Rosales","year":"2022","unstructured":"Cruz-Rosales MH, Cruz-Ch\u00e1vez MA, Alonso-Pecina F, Peralta-Abarca JC, \u00c1vila-Melgar EY, Mart\u00ednez-Bahena B, Enr\u00edquez-Urbano J (2022) Metaheuristic with cooperative processes for the university course timetabling problem. Appl Sci (switzerland) 12(2):542","journal-title":"Appl Sci (switzerland)"},{"key":"7810_CR39","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-44949-9_6","volume":"8271","author":"K Dapa","year":"2013","unstructured":"Dapa K, Loreungthup P, Vitayasak S, Pongcharoen P (2013) Bat algorithm, genetic algorithm and shuffled frog leaping algorithm for designing machine layout. Lect Notes Comput Sci 8271:59\u201368","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"7810_CR40","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.ejor.2008.01.043","volume":"195","author":"P De Causmaecker","year":"2009","unstructured":"De Causmaecker P, Demeester P, Vanden Berghe G (2009) A decomposed metaheuristic approach for a real-world university timetabling problem. Eur J Oper Res 195(1):307\u2013318","journal-title":"Eur J Oper Res"},{"issue":"1","key":"7810_CR41","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10951-021-00701-x","volume":"25","author":"A De Coster","year":"2022","unstructured":"De Coster A, Musliu N, Schaerf A, Schoisswohl J, Smith-Miles K (2022) Algorithm selection and instance space analysis for curriculum-based course timetabling. J Sched 25(1):35\u201358","journal-title":"J Sched"},{"key":"7810_CR42","doi-asserted-by":"publisher","first-page":"114694","DOI":"10.1016\/j.eswa.2021.114694","volume":"174","author":"F de la Rosa-Rivera","year":"2021","unstructured":"de la Rosa-Rivera F, Nunez-Varela JI, Ortiz-Bayliss JC, Terashima-Mar\u00edn H (2021) Algorithm selection for solving educational timetabling problems. Expert Syst Appl 174:114694","journal-title":"Expert Syst Appl"},{"key":"7810_CR43","doi-asserted-by":"crossref","unstructured":"Dino Matija\u0161 V, Molnar G, \u010cupi\u0107 M, Jakobovi\u0107 D, Dalbelo Ba\u0161i\u0107 B (2010) University course timetabling using ACO: a case study on laboratory exercises. In: Lecture notes in computer science, 6276 LNAI, pp 100\u2013110","DOI":"10.1007\/978-3-642-15387-7_14"},{"key":"7810_CR44","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/978-3-642-38667-1_36","volume":"211","author":"YJ Dun","year":"2014","unstructured":"Dun YJ, Wang Q, Shao YB (2014) A simulated annealing genetic algorithm for solving timetable problems. Adv Intell Syst Comput 211:365\u2013374","journal-title":"Adv Intell Syst Comput"},{"key":"7810_CR45","first-page":"8958393","volume":"2018","author":"S Faudzi","year":"2018","unstructured":"Faudzi S, Abdul-Rahman S, Abd Rahman R (2018) An assignment problem and its application in education domain: a review and potential path. Adv Oper Res 2018:8958393","journal-title":"Adv Oper Res"},{"key":"7810_CR46","doi-asserted-by":"publisher","unstructured":"Feutrier T, Kessaci ME, Veerapen N (2021) Investigating the landscape of a hybrid local search approach for a timetabling problem. In: Proceedings of the 2021 genetic and evolutionary computation conference companion, France, 10\u201314 July 2021, pp 1665\u20131673. https:\/\/doi.org\/10.1145\/3449726.3463175","DOI":"10.1145\/3449726.3463175"},{"key":"7810_CR47","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.swevo.2013.06.001","volume":"13","author":"I Fister","year":"2013","unstructured":"Fister I, Fister I Jr, Yang X-S, Brest J (2013) A comprehensive review of firefly algorithms. Swarm Evol Comput 13:34\u201346","journal-title":"Swarm Evol Comput"},{"key":"7810_CR48","first-page":"155","volume":"252","author":"I Fister Jr","year":"2015","unstructured":"Fister I Jr, Perc M, Kamal SM, Fister I (2015) A review of chaos-based firefly algorithms: perspectives and research challenges. Appl Math Comput 252:155\u2013165","journal-title":"Appl Math Comput"},{"issue":"6","key":"7810_CR49","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1109\/TEVC.2015.2411741","volume":"19","author":"CW Fong","year":"2015","unstructured":"Fong CW, Asmuni H, McCollum B (2015) A hybrid swarm-based approach to university timetabling. IEEE Trans Evol Comput 19(6):870\u2013884","journal-title":"IEEE Trans Evol Comput"},{"key":"7810_CR50","unstructured":"Geiger MJ (2008) An application of the threshold accepting metaheuristic for curriculum based course timetabling. In: Proceedings of the 7th international conference on the practice and theory of automated timetabling, PATAT 2008, Canada, 19\u201322 August 2008"},{"issue":"1","key":"7810_CR51","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10479-010-0703-4","volume":"194","author":"MJ Geiger","year":"2012","unstructured":"Geiger MJ (2012) Applying the threshold accepting metaheuristic to curriculum based course timetabling A contribution to the second international timetabling competition ITC 2007. Ann Oper Res 194(1):189\u2013202","journal-title":"Ann Oper Res"},{"key":"7810_CR52","volume-title":"Genetic algorithms and engineering design","author":"M Gen","year":"1997","unstructured":"Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York"},{"issue":"3","key":"7810_CR53","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1007\/s11831-021-09624-4","volume":"29","author":"S Ghafori","year":"2022","unstructured":"Ghafori S, Gharehchopogh FS (2022) Advances in spotted hyena optimizer: a comprehensive survey. Arch Comput Methods Eng 29(3):1569\u20131590","journal-title":"Arch Comput Methods Eng"},{"issue":"4","key":"7810_CR54","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1007\/s42235-022-00185-1","volume":"19","author":"FS Gharehchopogh","year":"2022","unstructured":"Gharehchopogh FS (2022) An improved tunicate swarm algorithm with best-random mutation strategy for global optimization problems. J Bionic Eng 19(4):1177\u20131202","journal-title":"J Bionic Eng"},{"key":"7810_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2019.03.004","volume":"48","author":"FS Gharehchopogh","year":"2019","unstructured":"Gharehchopogh FS, Gholizadeh H (2019) A comprehensive survey: whale optimization algorithm and its applications. Swarm Evol Comput 48:1\u201324","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"7810_CR56","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11831-022-09804-w","volume":"30","author":"FS Gharehchopogh","year":"2022","unstructured":"Gharehchopogh FS, Namazi M, Ebrahimi L, Abdollahzadeh B (2022) Advances in sparrow search algorithm: a comprehensive survey. Arch Comput Methods Eng 30(1):427\u2013455. https:\/\/doi.org\/10.1007\/s11831-022-09804-w","journal-title":"Arch Comput Methods Eng"},{"issue":"3","key":"7810_CR57","doi-asserted-by":"publisher","first-page":"2265","DOI":"10.1007\/s10462-019-09733-4","volume":"53","author":"FS Gharehchopogh","year":"2020","unstructured":"Gharehchopogh FS, Shayanfar H, Gholizadeh H (2020) A comprehensive survey on symbiotic organisms search algorithms. Artif Intell Rev 53(3):2265\u20132312","journal-title":"Artif Intell Rev"},{"issue":"1","key":"7810_CR58","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2017.01.040","volume":"261","author":"SL Goh","year":"2017","unstructured":"Goh SL, Kendall G, Sabar NR (2017) Improved local search approaches to solve the post enrolment course timetabling problem. Eur J Oper Res 261(1):17\u201329","journal-title":"Eur J Oper Res"},{"key":"7810_CR59","unstructured":"Gunawan A, Ming NK, Leng PK (2008) A hybrid algorithm for the university course timetabling problem. In: Proceedings of 7th international conference on the practice and theory of automated timetabling, PATAT 2008, Canada, 19\u201322 August 2008"},{"key":"7810_CR60","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11496199_8","volume":"3521","author":"Y He","year":"2005","unstructured":"He Y, Hui S, Lai E-K (2005) automatic timetabling using artificial immune system. Lect Notes Comput Sci 3521:55\u201365","journal-title":"Lect Notes Comput Sci"},{"key":"7810_CR61","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.eswa.2019.02.026","volume":"127","author":"S Imran Hossain","year":"2019","unstructured":"Imran Hossain S, Akhand MAH, Shuvo MIR, Siddique N, Adeli H (2019) Optimization of university course scheduling problem using particle swarm optimization with selective search. Expert Syst Appl 127:9\u201324","journal-title":"Expert Syst Appl"},{"key":"7810_CR62","doi-asserted-by":"publisher","first-page":"101539","DOI":"10.1016\/j.scs.2019.101539","volume":"48","author":"T Jafarinejad","year":"2019","unstructured":"Jafarinejad T, Erfani A, Fathi A, Shafii MB (2019) Bi-level energy-efficient occupancy profile optimization integrated with demand-driven control strategy: university building energy saving. Sustain Cities Soc 48:101539","journal-title":"Sustain Cities Soc"},{"key":"7810_CR63","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.cor.2015.12.016","volume":"70","author":"T Januario","year":"2016","unstructured":"Januario T, Urrutia S (2016) A new neighborhood structure for round robin scheduling problems. Comput Oper Res 70:127\u2013139","journal-title":"Comput Oper Res"},{"issue":"3","key":"7810_CR64","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10878-012-9521-8","volume":"27","author":"G Jaradat","year":"2014","unstructured":"Jaradat G, Ayob M, Ahmad Z (2014) On the performance of Scatter Search for post-enrolment course timetabling problems. J Comb Optim 27(3):417\u2013439","journal-title":"J Comb Optim"},{"key":"7810_CR65","first-page":"167","volume":"118 CCIS","author":"GM Jaradat","year":"2010","unstructured":"Jaradat GM, Ayob M (2010) An elitist-ant system for solving the post-enrolment course timetabling problem. Commun Comput Inf Sci 118 CCIS:167\u2013176","journal-title":"Commun Comput Inf Sci"},{"key":"7810_CR66","doi-asserted-by":"crossref","unstructured":"Jaradat GM, Ayob M (2011) Scatter search for solving the course timetabling problem. In: Proceedings of the conference on data mining and optimization (DMO 2011), Malaysia, 28\u201329 June 2011, pp 213\u2013218","DOI":"10.1109\/DMO.2011.5976530"},{"issue":"2","key":"7810_CR67","first-page":"96","volume":"8","author":"GM Jaradat","year":"2013","unstructured":"Jaradat GM, Ayob M (2013) Effect of elite pool and euclidean distance in big bang-big crunch metaheuristic for post-enrolment course timetabling problems. Int J Soft Comput 8(2):96\u2013107","journal-title":"Int J Soft Comput"},{"key":"7810_CR68","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-20364-0_1","volume":"6622","author":"SN Jat","year":"2011","unstructured":"Jat SN, Yang SX (2011) A guided search non-dominated sorting genetic algorithm for the multi-objective university course timetabling problem. Lect Notes Comput Sci 6622:1\u201313","journal-title":"Lect Notes Comput Sci"},{"key":"7810_CR69","unstructured":"Joudaki M, Imani M, Mazhari N (2011) Using improved memetic algorithm and local search to solve university Course Timetabling problem (UCTP). In: Proceedings of the 2011 international conference on artificial intelligence (ICAI 2011), 18\u201321 July 2011, pp 501\u2013506"},{"issue":"2","key":"7810_CR70","first-page":"172","volume":"63","author":"A Jula","year":"2011","unstructured":"Jula A, Naseri NK (2011) Using CMAC to obtain dynamic mutation rate in a metaheuristic memetic algorithm to solve university timetabling problem. Eur J Sci Res 63(2):172\u2013181","journal-title":"Eur J Sci Res"},{"issue":"11","key":"7810_CR71","doi-asserted-by":"publisher","first-page":"11413","DOI":"10.1166\/asl.2017.10295","volume":"23","author":"KY Junn","year":"2017","unstructured":"Junn KY, Obit JH, Alfred R (2017) Comparison of simulated annealing and great deluge algorithms for university course timetabling problems (UCTP). Adv Sci Lett 23(11):11413\u201311417","journal-title":"Adv Sci Lett"},{"key":"7810_CR72","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-981-10-8276-4_43","volume":"488","author":"KY Junn","year":"2018","unstructured":"Junn KY, Obit JH, Alfred R (2018) The study of genetic algorithm approach to solving university course timetabling problem. Lect Notes Electr Eng 488:454\u2013463","journal-title":"Lect Notes Electr Eng"},{"key":"7810_CR73","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/j.asoc.2014.11.005","volume":"27","author":"S Karakati\u010d","year":"2015","unstructured":"Karakati\u010d S, Podgorelec V (2015) A survey of genetic algorithms for solving multi depot vehicle routing problem. Appl Soft Comput 27:519\u2013532","journal-title":"Appl Soft Comput"},{"key":"7810_CR74","doi-asserted-by":"crossref","unstructured":"Karami AH, Hasanzadeh M (2012) University course timetabling using a new hybrid genetic algorithm. In: Proceedings of the 2nd international econference on computer and knowledge engineering (ICCKE 2012), Iran, 18\u201319 October 2012, pp 144\u2013149","DOI":"10.1109\/ICCKE.2012.6395368"},{"issue":"1","key":"7810_CR75","first-page":"49","volume":"8","author":"A Khadwilard","year":"2012","unstructured":"Khadwilard A, Chansombat S, Thepphakorn T, Thapatsuwan P, Chainate W, Pongcharoen P (2012) Application of firefly algorithm and its parameter setting for job shop scheduling. J Ind Technol 8(1):49\u201358","journal-title":"J Ind Technol"},{"key":"7810_CR76","unstructured":"Khang NTTM, Phuc NB, Nuong TTH (2011) The bees algorithm for a practical university timetabling problem in Vietnam. In: Proceedings of the IEEE international conference on computer science and automation engineering (CSAE 2011), China, 10\u201312 June 2011, pp 42\u201347"},{"issue":"2","key":"7810_CR77","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10479-016-2151-2","volume":"252","author":"A Kiefer","year":"2017","unstructured":"Kiefer A, Hartl RF, Schnell A (2017) Adaptive large neighborhood search for the curriculum-based course timetabling problem. Ann Oper Res 252(2):255\u2013282","journal-title":"Ann Oper Res"},{"key":"7810_CR78","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11593577_7","volume":"3616 LNCS","author":"P Kostuch","year":"2005","unstructured":"Kostuch P (2005) The university course timetabling problem with a three-phase approach. Lect Notes Comput Sci 3616 LNCS:109\u2013125","journal-title":"Lect Notes Comput Sci"},{"issue":"10","key":"7810_CR79","first-page":"121","volume":"12","author":"PD Kusuma","year":"2021","unstructured":"Kusuma PD, Albana AS (2021) University course timetabling model in joint courses program to minimize the number of unserved requests. Int J Adv Comput Sci Appl 12(10):121\u2013127","journal-title":"Int J Adv Comput Sci Appl"},{"key":"7810_CR80","doi-asserted-by":"crossref","unstructured":"La'aro Bolaji A, Tajudin Khader A, Azmi Al-Betar M, Awadallah MA (2011) An improved artificial bee colony for Course Timetabling. In: Proceedings of the 6th international conference on bio-inspired computing: theories and applications (BIC-TA 2011), Malaysia, 27\u201329 September 2011, pp 9\u201314","DOI":"10.1109\/BIC-TA.2011.74"},{"issue":"1","key":"7810_CR81","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.ejor.2018.09.027","volume":"285","author":"A Legrain","year":"2020","unstructured":"Legrain A, Omer J, Rosat S (2020) An online stochastic algorithm for a dynamic nurse scheduling problem. Eur J Oper Res 285(1):196\u2013210","journal-title":"Eur J Oper Res"},{"issue":"1","key":"7810_CR82","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R Lewis","year":"2008","unstructured":"Lewis R (2008) A survey of metaheuristic-based techniques for University Timetabling problems. Or Spectrum 30(1):167\u2013190","journal-title":"Or Spectrum"},{"issue":"1","key":"7810_CR83","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10479-010-0696-z","volume":"194","author":"R Lewis","year":"2012","unstructured":"Lewis R (2012) A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. Ann Oper Res 194(1):273\u2013289","journal-title":"Ann Oper Res"},{"issue":"3","key":"7810_CR84","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.ejor.2014.07.041","volume":"240","author":"R Lewis","year":"2015","unstructured":"Lewis R, Thompson J (2015) Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem. Eur J Oper Res 240(3):637\u2013648","journal-title":"Eur J Oper Res"},{"issue":"1","key":"7810_CR85","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2017.09.022","volume":"266","author":"M Lindahl","year":"2018","unstructured":"Lindahl M, Mason AJ, Stidsen T, Sorensen M (2018a) A strategic view of University timetabling. Eur J Oper Res 266(1):35\u201345","journal-title":"Eur J Oper Res"},{"issue":"4","key":"7810_CR86","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10732-018-9371-3","volume":"24","author":"M Lindahl","year":"2018","unstructured":"Lindahl M, Sorensen M, Stidsen TR (2018b) A fix-and-optimize matheuristic for university timetabling. J Heurist 24(4):645\u2013665","journal-title":"J Heurist"},{"key":"7810_CR87","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1016\/j.trb.2017.08.024","volume":"117","author":"T Liu","year":"2018","unstructured":"Liu T, Ceder A (2018) Integrated public transport timetable synchronization and vehicle scheduling with demand assignment: a bi-objective bi-level model using deficit function approach. Transp Res Part b: Methodol 117:935\u2013955","journal-title":"Transp Res Part b: Methodol"},{"issue":"2","key":"7810_CR88","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10732-010-9128-0","volume":"17","author":"ZP Lu","year":"2011","unstructured":"Lu ZP, Hao JK, Glover F (2011) Neighborhood analysis: a case study on curriculum-based course timetabling. J Heurist 17(2):97\u2013118","journal-title":"J Heurist"},{"key":"7810_CR89","doi-asserted-by":"crossref","unstructured":"Mansour N, El-Jazzar H (2013) Curriculum based course timetabling. In: Proceedings of the 9th international conference on natural computation, China, 23\u201325 July 2013, pp 787\u2013792","DOI":"10.1109\/ICNC.2013.6818082"},{"key":"7810_CR90","doi-asserted-by":"crossref","unstructured":"Matias JB, Fajardo AC, Medina RM (2018) A fair course timetabling using genetic algorithm with guided search technique. In: Proceedings of the 5th international conference on business and industrial research: smart technology for next generation of information, engineering, business and social science (ICBIR 2018), Thailand, 17\u201318 May 2018, pp 77\u201382","DOI":"10.1109\/ICBIR.2018.8391170"},{"key":"7810_CR91","doi-asserted-by":"crossref","unstructured":"Mauritsius T, Fajar AN, Harisno, John P (2018) Novel local searches for finding feasible solutions in educational timetabling problem. In: Proceedings of the 5th international conference on instrumentation, communications, information technology, and biomedical engineering (ICICI-BME 2017), Indonesia, 6\u20137 November 2017, pp 270\u2013275","DOI":"10.1109\/ICICI-BME.2017.8537723"},{"key":"7810_CR92","unstructured":"Mayer A, Nothegger C, Chwatal A, Raidl GR (2008) Solving the post enrolment course timetabling problem by ant colony optimization. In: Proceedings of the 7th international conference on the practice and theory of automated timetabling, PATAT 2008, Canada, 19\u201322 August 2008"},{"issue":"1","key":"7810_CR93","first-page":"72","volume":"13","author":"M Mazlan","year":"2019","unstructured":"Mazlan M, Makhtar M, Ahmad Khairi AFK, Mohamed MA (2019) University course timetabling model using ant colony optimization algorithm approach. Indones J Electr Eng Comput Sci 13(1):72\u201376","journal-title":"Indones J Electr Eng Comput Sci"},{"key":"7810_CR94","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2012","unstructured":"Montgomery DC (2012) Design and analysis of experiments, 8th edn. Wiley, New York","edition":"8"},{"key":"7810_CR95","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-77345-0_13","volume":"3867","author":"K Murray","year":"2007","unstructured":"Murray K, M\u00fcller T, Rudov\u00e1 H (2007) Modeling and solution of a complex university course timetabling problem. Lect Notes Comput Sci 3867:189\u2013209","journal-title":"Lect Notes Comput Sci"},{"key":"7810_CR96","doi-asserted-by":"publisher","first-page":"114211","DOI":"10.1016\/j.eswa.2020.114211","volume":"168","author":"MHT Najaran","year":"2020","unstructured":"Najaran MHT (2020) How to exploit fitness landscape properties of timetabling problem: a new operator for quantum evolutionary algorithm. Expert Syst Appl 168:114211","journal-title":"Expert Syst Appl"},{"key":"7810_CR97","doi-asserted-by":"crossref","unstructured":"Nguyen K, Dang N, Trieu K, Tran N (2010) Automating a real-world university timetabling problem with Tabu search algorithm. In: Proceedings of the IEEE international conference on computing and communication technologies: research, innovation and vision for the future (RIVF 2010), 1\u20134 November 2010, p 5632720","DOI":"10.1109\/RIVF.2010.5632720"},{"key":"7810_CR98","doi-asserted-by":"crossref","unstructured":"Nguyen K, Nguyen Q, Tran H, Nguyen P, Tran N (2011) Variable neighborhood search for a real-world curriculum-based university timetabling problem. In: Proceedings of the 3rd international conference on knowledge and systems engineering (KSE 2011), Vietnam, 11\u201317 October 2011, pp 157\u2013162","DOI":"10.1109\/KSE.2011.31"},{"issue":"1","key":"7810_CR99","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10479-012-1078-5","volume":"194","author":"C Nothegger","year":"2012","unstructured":"Nothegger C, Mayer A, Chwatal A, Raidl GR (2012) Solving the post enrolment course timetabling problem by ant colony optimization. Ann Oper Res 194(1):325\u2013339","journal-title":"Ann Oper Res"},{"key":"7810_CR100","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/978-3-319-47054-2_47","volume":"667","author":"LM Ortiz-Aguilar","year":"2017","unstructured":"Ortiz-Aguilar LM, Carpio M, Puga H, Soria-Alcaraz JA, Ornelas-Rodr\u00edguez M, Lino C (2017) Increase methodology of design of course timetabling problem for students, classrooms, and teachers. Stud Comput Intell 667:713\u2013728","journal-title":"Stud Comput Intell"},{"key":"7810_CR101","volume-title":"Tcl and the Tk Toolkit","author":"JK Ousterhout","year":"2009","unstructured":"Ousterhout JK, Jones K (2009) Tcl and the Tk Toolkit, 2nd edn. Addison-Wesley","edition":"2"},{"issue":"10","key":"7810_CR102","doi-asserted-by":"publisher","first-page":"2310","DOI":"10.1016\/j.cor.2011.11.020","volume":"39","author":"E Ozcan","year":"2012","unstructured":"Ozcan E, Parkes AJ, Alkan A (2012) The interleaved constructive memetic algorithm and its application to timetabling. Comput Oper Res 39(10):2310\u20132322","journal-title":"Comput Oper Res"},{"key":"7810_CR103","doi-asserted-by":"crossref","unstructured":"Pack CD, Christensen EW, Potter RM, Forys L, Erramilli A (2011) Using metaheuristics and queueing models to optimize schedules in the academic enterprise. In: Proceedings of the IEEE symposium on computational intelligence in scheduling (CISched 2011), France, 11\u201315 April 2011, pp 1\u20138","DOI":"10.1109\/SCIS.2011.5976544"},{"key":"7810_CR104","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.asoc.2014.08.025","volume":"24","author":"HM Pandey","year":"2014","unstructured":"Pandey HM, Chaudhary A, Mehrotra D (2014) A comparative review of approaches to prevent premature convergence in GA. Appl Soft Comput 24:1047\u20131077","journal-title":"Appl Soft Comput"},{"key":"7810_CR105","doi-asserted-by":"crossref","unstructured":"Pansuwan P, Rukwong N, Pongcharoen P (2010) Identifying optimum artificial bee colony (ABC) algorithm's parameters for scheduling the manufacture and assembly of complex products. In: Proceedings of the 2nd international conference on computer and network technology (ICCNT 2010), Thailand, 23\u201325 April 2010, pp 339\u2013343","DOI":"10.1109\/ICCNT.2010.25"},{"key":"7810_CR106","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.jclepro.2017.04.132","volume":"158","author":"J Patel","year":"2017","unstructured":"Patel J, Savsani V, Patel V, Patel R (2017) Layout optimization of a wind farm to maximize the power output using enhanced teaching learning based optimization technique. J Clean Prod 158:81\u201394","journal-title":"J Clean Prod"},{"key":"7810_CR107","doi-asserted-by":"crossref","unstructured":"Phuc NB, Khang NTTM, Nuong TTH (2011) A new hybrid GA-Bees algorithm for a real-world university timetabling problem. In: Proceedings of the international conference on intelligent computation and bio-medical instrumentation (ICBMI 2011), China, 14\u201317 December 2011, pp 321\u2013326","DOI":"10.1109\/ICBMI.2011.33"},{"issue":"1","key":"7810_CR108","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10479-017-2625-x","volume":"275","author":"N Pillay","year":"2019","unstructured":"Pillay N, \u00d6zcan E (2019) Automated generation of constructive ordering heuristics for educational timetabling. Ann Oper Res 275(1):181\u2013208","journal-title":"Ann Oper Res"},{"issue":"1","key":"7810_CR109","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0377-2217(02)00645-8","volume":"152","author":"P Pongcharoen","year":"2004","unstructured":"Pongcharoen P, Hicks C, Braiden PM (2004) The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure. Eur J Oper Res 152(1):215\u2013225","journal-title":"Eur J Oper Res"},{"issue":"2","key":"7810_CR110","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/j.ijpe.2007.07.009","volume":"112","author":"P Pongcharoen","year":"2008","unstructured":"Pongcharoen P, Promtet W, Yenradee P, Hicks C (2008) Stochastic optimisation timetabling tool for university course scheduling. Int J Prod Econ 112(2):903\u2013918","journal-title":"Int J Prod Econ"},{"key":"7810_CR111","doi-asserted-by":"crossref","unstructured":"Qarouni-Fard D, Najafi-Ardabifi A, Moeinzadeh MH, Sharifian RS, Asgarian E, Mohammadzadeh J (2008) Finding feasible timetables with particle swarm optimization. In: Proceedings of the 4th international conference on innovations in information technology (IIT 2007), United Arab Emirates, 18\u201320 November 2007, pp 387\u2013391","DOI":"10.1109\/IIT.2007.4430422"},{"key":"7810_CR112","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-45157-0_22","volume":"2740","author":"O Rossi-Doria","year":"2003","unstructured":"Rossi-Doria O, Sampels M, Birattari M, Chiarandini M, Dorigo M, Gambardella LM et al (2003) A comparison of the performance of different metaheuristics on the timetabling problem. Lect Notes Comput Sci 2740:329\u2013351","journal-title":"Lect Notes Comput Sci"},{"issue":"3","key":"7810_CR113","first-page":"1556","volume":"20","author":"SMC Sapul","year":"2020","unstructured":"Sapul SMC, Setthawong R, Setthawong P (2020) New hybrid flower pollination algorithm with dragonfly algorithm and jaccard index to enhance solving university course timetable problem. Indones J Electr Eng Comput Sci 20(3):1556\u20131568","journal-title":"Indones J Electr Eng Comput Sci"},{"key":"7810_CR114","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.asoc.2018.07.033","volume":"71","author":"H Shayanfar","year":"2018","unstructured":"Shayanfar H, Gharehchopogh FS (2018) Farmland fertility: a new metaheuristic algorithm for solving continuous optimization problems. Appl Soft Comput J 71:728\u2013746","journal-title":"Appl Soft Comput J"},{"key":"7810_CR115","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dss.2018.08.005","volume":"114","author":"AW Siddiqui","year":"2018","unstructured":"Siddiqui AW, Raza SA, Tariq ZM (2018) A web-based group decision support system for academic term preparation. Decis Support Syst 114:1\u201317","journal-title":"Decis Support Syst"},{"key":"7810_CR116","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-36605-9_31","volume":"2611","author":"K Socha","year":"2003","unstructured":"Socha K, Sampels M, Manfrin M (2003) Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. Lect Notes Comput Sci 2611:334\u2013345","journal-title":"Lect Notes Comput Sci"},{"key":"7810_CR117","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106480","volume":"94","author":"S Sooncharoen","year":"2020","unstructured":"Sooncharoen S, Pongcharoen P, Hicks C (2020) Grey Wolf production scheduling for the capital goods industry. Appl Soft Comput 94:106480","journal-title":"Appl Soft Comput"},{"key":"7810_CR118","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-35323-9_12","volume":"294","author":"JA Soria-Alcaraz","year":"2013","unstructured":"Soria-Alcaraz JA, Martin C, H\u00e9ctor P, Hugo TM, Laura CR, Sotelo-Figueroa MA (2013) Methodology of design: a novel generic approach applied to the course timetabling problem. Stud Fuzz Soft Comput 294:287\u2013319","journal-title":"Stud Fuzz Soft Comput"},{"key":"7810_CR119","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-319-47054-2_45","volume":"667","author":"JA Soria-Alcaraz","year":"2017","unstructured":"Soria-Alcaraz JA, Ochoa G, Sotelo-Figueroa MA, Carpio M, Puga H (2017) Iterated VND versus hyper-heuristics: effective and general approaches to course timetabling. Stud Comput Intell 667:687\u2013700","journal-title":"Stud Comput Intell"},{"issue":"1","key":"7810_CR120","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2014.03.046","volume":"238","author":"JA Soria-Alcaraz","year":"2014","unstructured":"Soria-Alcaraz JA, Ochoa G, Swan J, Carpio M, Puga H, Burke EK (2014) Effective learning hyper-heuristics for the course timetabling problem. Eur J Oper Res 238(1):77\u201386","journal-title":"Eur J Oper Res"},{"key":"7810_CR121","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-33021-6_23","volume":"451","author":"A Soria-Alcaraz Jorge","year":"2013","unstructured":"Soria-Alcaraz Jorge A, Mart\u00edn C, H\u00e9ctor P, Sotelo-Figueroa MA (2013) Comparison of metaheuristic algorithms with a methodology of design for the evaluation of hard constraints over the course timetabling problem. Stud Comput Intell 451:289\u2013302","journal-title":"Stud Comput Intell"},{"key":"7810_CR122","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-022-00747-5","author":"K Sylejmani","year":"2022","unstructured":"Sylejmani K, Gashi E, Ymeri A (2022) Simulated annealing with penalization for university course timetabling. J Sched. https:\/\/doi.org\/10.1007\/s10951-022-00747-5","journal-title":"J Sched"},{"key":"7810_CR123","doi-asserted-by":"crossref","unstructured":"Talbi E-G (2009) Metaheuristics: from design to implementation. Wiley","DOI":"10.1002\/9780470496916"},{"issue":"7","key":"7810_CR124","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.3923\/jas.2013.1087.1093","volume":"13","author":"HY Tarawneh","year":"2013","unstructured":"Tarawneh HY, Ayob M (2013) Adaptive neighbourhoods structure selection mechanism in simulated annealing for solving university course timetabling problems. J Appl Sci 13(7):1087\u20131093","journal-title":"J Appl Sci"},{"issue":"1","key":"7810_CR125","doi-asserted-by":"publisher","first-page":"1450002","DOI":"10.1142\/S1469026814500023","volume":"13","author":"CK Teoh","year":"2014","unstructured":"Teoh CK, Wibowo A, Ngadiman MS (2014) An adapted cuckoo optimization algorithm and genetic algorithm approach to the university course timetabling problem. Int J Comput Intell Appl 13(1):1450002","journal-title":"Int J Comput Intell Appl"},{"issue":"3","key":"7810_CR126","first-page":"113","volume":"5","author":"T Thepphakorn","year":"2013","unstructured":"Thepphakorn T, Pongcharoen P (2013) Heuristic ordering for ant colony based timetabling tool. J Appl Oper Res 5(3):113\u2013123","journal-title":"J Appl Oper Res"},{"key":"7810_CR127","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-26369-0_17","volume":"11655","author":"T Thepphakorn","year":"2019","unstructured":"Thepphakorn T, Pongcharoen P (2019) Variants and parameters investigations of particle swarm optimisation for solving course timetabling problems. Lect Notes Comput Sci 11655:177\u2013187","journal-title":"Lect Notes Comput Sci"},{"key":"7810_CR128","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113732","volume":"161","author":"T Thepphakorn","year":"2020","unstructured":"Thepphakorn T, Pongcharoen P (2020) Performance improvement strategies on Cuckoo Search algorithms for solving the university course timetabling problem. Expert Syst Appl 161:113732","journal-title":"Expert Syst Appl"},{"key":"7810_CR129","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.ijpe.2013.04.026","volume":"149","author":"T Thepphakorn","year":"2014","unstructured":"Thepphakorn T, Pongcharoen P, Hicks C (2014) An ant colony based timetabling tool. Int J Prod Econ 149:131\u2013144","journal-title":"Int J Prod Econ"},{"key":"7810_CR130","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1155\/2015\/841748","volume":"2015","author":"T Thepphakorn","year":"2015","unstructured":"Thepphakorn T, Pongcharoen P, Hicks C (2015) Modifying regeneration mutation and hybridising clonal selection for evolutionary algorithms based timetabling tool. Math Probl Eng 2015:16","journal-title":"Math Probl Eng"},{"key":"7810_CR131","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-030-51968-1_28","volume":"12218 LNCS","author":"T Thepphakorn","year":"2020","unstructured":"Thepphakorn T, Sooncharoen S, Pongcharoen P (2020a) Academic operating costs optimisation using hybrid mcpso based course timetabling tool. Lect Notes Comput Sci 12218 LNCS:338\u2013350","journal-title":"Lect Notes Comput Sci"},{"key":"7810_CR132","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-030-60816-3_40","volume":"12341 LNCS","author":"T Thepphakorn","year":"2020","unstructured":"Thepphakorn T, Sooncharoen S, Pongcharoen P (2020b) Static and dynamic parameter settings of accelerated particle swarm optimisation for solving course scheduling problem. Lect Notes Comput Sci 12341 LNCS:368\u2013380","journal-title":"Lect Notes Comput Sci"},{"issue":"4","key":"7810_CR133","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s42979-021-00652-2","volume":"2","author":"T Thepphakorn","year":"2021","unstructured":"Thepphakorn T, Sooncharoen S, Pongcharoen P (2021) Particle swarm optimisation variants and its hybridisation ratios for generating cost-effective educational course timetables. SN Comput Sci 2(4):264","journal-title":"SN Comput Sci"},{"issue":"3","key":"7810_CR134","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10462-017-9568-0","volume":"51","author":"SL Tilahun","year":"2019","unstructured":"Tilahun SL, Ngnotchouye JMT, Hamadneh NN (2019) Continuous versions of firefly algorithm: a review. Artif Intell Rev 51(3):445\u2013492","journal-title":"Artif Intell Rev"},{"key":"7810_CR135","doi-asserted-by":"crossref","unstructured":"Turabieh H, El-Daoud E (2012) University course timetabling problem at Zarqa University. In: Proceedings of the the 3rd international conference on information and communication systems (ICICS 2012), Jordan, 3\u20135 April 2012, pp 1\u20134","DOI":"10.1145\/2222444.2222452"},{"key":"7810_CR136","doi-asserted-by":"crossref","unstructured":"Urva G, Sellyana A (2019) Genetic algorithm for optimization of lecturer schedule preparation. In: Proceedings of the 1st international conference on advance and scientific innovation, Indonesia, 23\u201324 April 2018, pp 1\u20136","DOI":"10.1088\/1742-6596\/1175\/1\/012042"},{"key":"7810_CR137","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.eswa.2018.01.005","volume":"98","author":"S Vitayasak","year":"2018","unstructured":"Vitayasak S, Pongcharoen P (2018) Performance improvement of Teaching-Learning-Based Optimisation for robust machine layout design. Expert Syst Appl 98:129\u2013152","journal-title":"Expert Syst Appl"},{"issue":"2","key":"7810_CR138","first-page":"1109","volume":"15","author":"J Wahid","year":"2019","unstructured":"Wahid J, Abdul-Rahman S, Mohamed Din A, Mohd-Hussin N (2019) Constructing population of initial university timetable: design and analysis. Indones J Electr Eng Comput Sci 15(2):1109\u20131118","journal-title":"Indones J Electr Eng Comput Sci"},{"key":"7810_CR139","doi-asserted-by":"crossref","unstructured":"Wahid J, Hussin NM (2016a) Combination of graph heuristics in producing initial solution of curriculum based course timetabling problem. In: Proceedings of the international conference on applied science and technology (ICAST 2016a), Malaysia, 11\u201313 April 2016a","DOI":"10.1063\/1.4960944"},{"issue":"8","key":"7810_CR140","first-page":"91","volume":"8","author":"J Wahid","year":"2016","unstructured":"Wahid J, Hussin NM (2016b) Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics. J Telecommun, Electron Comput Eng 8(8):91\u201395","journal-title":"J Telecommun, Electron Comput Eng"},{"key":"7810_CR141","doi-asserted-by":"crossref","unstructured":"Wong CH, Goh SL, Likoh J (2022) A genetic algorithm for the real-world university course timetabling problem. In: 18th international colloquium on signal processing and applications, May 12, 2022, pp 46\u201350","DOI":"10.1109\/CSPA55076.2022.9781907"},{"issue":"2","key":"7810_CR142","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1504\/IJBIC.2010.032124","volume":"2","author":"X-S Yang","year":"2010","unstructured":"Yang X-S (2010a) Firefly algorithm, stochastic test functions and design optimisation. Int J Bio-Inspired Comput 2(2):78\u201384","journal-title":"Int J Bio-Inspired Comput"},{"key":"7810_CR143","volume-title":"Nature-inspired metaheuristic algorithms","author":"X-S Yang","year":"2010","unstructured":"Yang X-S (2010b) Nature-inspired metaheuristic algorithms, 2nd edn. Luniver Press, University of Cambrige","edition":"2"},{"key":"7810_CR144","doi-asserted-by":"crossref","unstructured":"Yang X-S (2014a) Nature-Inspired optimization algorithms: Elsevier","DOI":"10.1016\/B978-0-12-416743-8.00010-5"},{"issue":"1","key":"7810_CR145","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1504\/IJSI.2013.055801","volume":"1","author":"X-S Yang","year":"2013","unstructured":"Yang X-S, He X (2013) Firefly algorithm: recent advances and applications. Int J Swarm Intell 1(1):36\u201350","journal-title":"Int J Swarm Intell"},{"key":"7810_CR146","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-02141-6_1","volume":"516","author":"XS Yang","year":"2014","unstructured":"Yang XS (2014b) Cuckoo search and firefly algorithm: overview and analysis. Stud Comput Intell 516:1\u201326","journal-title":"Stud Comput Intell"},{"issue":"7\u20138","key":"7810_CR147","doi-asserted-by":"publisher","first-page":"2051","DOI":"10.1007\/s00521-013-1498-4","volume":"23","author":"XS Yang","year":"2013","unstructured":"Yang XS, Deb S, Loomes M, Karamanoglu M (2013) A framework for self-tuning optimization algorithm. Neural Comput Appl 23(7\u20138):2051\u20132057","journal-title":"Neural Comput Appl"},{"issue":"2","key":"7810_CR148","first-page":"131","volume":"8","author":"RM Yassin","year":"2013","unstructured":"Yassin RM, Nazri MZA, Abdullah S (2013) Hybrid approach: Tabu-based non-linear great deluge for the course timetabling problem. Res J Appl Sci 8(2):131\u2013138","journal-title":"Res J Appl Sci"},{"key":"7810_CR149","first-page":"241","volume":"24","author":"M Yazdani","year":"2017","unstructured":"Yazdani M, Naderi B, Zeinali E (2017) Algorithms for university course scheduling problems. Tehnicki Vjesnik 24:241\u2013247","journal-title":"Tehnicki Vjesnik"},{"issue":"1","key":"7810_CR150","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s11047-016-9543-8","volume":"16","author":"M-X Zhang","year":"2017","unstructured":"Zhang M-X, Zhang B, Qian N (2017) University course timetabling using a new ecogeography-based optimization algorithm. Nat Comput 16(1):61\u201374","journal-title":"Nat Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07810-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07810-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07810-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T01:55:13Z","timestamp":1701741313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07810-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,19]]},"references-count":150,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["7810"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07810-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,19]]},"assertion":[{"value":"30 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This manuscript has been read and approved by both authors having no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The manuscript has not been published elsewhere and is not being considered by any other journals.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The data considered in this manuscript were collected via the university\/faculty websites. The processes of program coding, numerical execution, and statistical analysis were based on personal computers.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}