{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T16:14:25Z","timestamp":1779380065989,"version":"3.53.1"},"reference-count":81,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3565522","type":"journal-article","created":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T17:32:33Z","timestamp":1745947953000},"page":"75679-75696","source":"Crossref","is-referenced-by-count":2,"title":["Optimality Versus Generality: Performance Assessment of Meta-Heuristics in Educational Timetabling"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8411-5451","authenticated-orcid":false,"given":"Sina","family":"Abdipoor","sequence":"first","affiliation":[{"name":"Department of Computer Science, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia (UPM), Serdang, Selangor, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8228-5753","authenticated-orcid":false,"given":"Razali","family":"Yaakob","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia (UPM), Serdang, Selangor, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4562-2519","authenticated-orcid":false,"given":"Say Leng","family":"Goh","sequence":"additional","affiliation":[{"name":"Optimization and Visual Analytics Research Group, Faculty of Computing and Informatics, Universiti Malaysia Sabah, Labuan International Campus, Labuan, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0037-841X","authenticated-orcid":false,"given":"Salwani","family":"Abdullah","sequence":"additional","affiliation":[{"name":"Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia (UKM), Bangi, Selangor, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1271-4257","authenticated-orcid":false,"given":"Hazlina","family":"Hamdan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia (UPM), Serdang, Selangor, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7018-5560","authenticated-orcid":false,"given":"Khairul Azhar","family":"Kasmiran","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia (UPM), Serdang, Selangor, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3100613"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3378054"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.07.011"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113943"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-020-05110-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s12597-020-00444-x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-024-00923-2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.iswa.2023.200253"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CSPA55076.2022.9781907"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.01.040"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123383"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6940-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.07.041"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-024-06363-0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-51778-1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/EIConCIT50028.2021.9431892"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/I2CACIS57635.2023.10193383"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2020.1796538"},{"key":"ref19","first-page":"5","article-title":"University course timetabling and international timetabling competition 2019","volume-title":"Proc. 12th Int. Conf. Pract. Theory Automated Timetabling (PATAT-)","author":"M\u00fcller"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3097778"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105731"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3177280"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/33447.33448"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2016.04.007"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-015-9249-1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.5784\/31-1-158"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-011-0309-9"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2011.12"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.03.021"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.04.043"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0475-2"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2323936"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-012-0295-8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_26"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_27"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.3390\/axioms12080720"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDI57181.2022.10007172"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01833-x"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1002\/tee.23067"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2018.1468862"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2411741"},{"key":"ref42","volume-title":"An Introduction to Optimization","volume":"76","author":"Chong","year":"2013"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.02.006"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-51691-2_26"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8"},{"issue":"12","key":"ref46","first-page":"2756","article-title":"No free lunch theorems for search","volume":"10","author":"Wolpert","year":"1995"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-66515-9_13"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12767-1_5"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67669-2_2"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00058-3"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.800886"},{"key":"ref53","article-title":"Population sizing for entropy-based model building in genetic algorithms","author":"Yu","year":"2006"},{"key":"ref54","first-page":"336","article-title":"On the supply of building blocks","volume-title":"Proc. 3rd Annu. Conf. Genetic Evol. Comput.","author":"Goldberg"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.3.231"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24855-2_11"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.02.016"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-013-0339-5"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-016-0417-5"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12631-9_7"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-023-00801-w"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/SmartCloud58862.2023.00035"},{"key":"ref63","first-page":"11","article-title":"A racing algorithm for configuring Metaheuristics","volume-title":"Proc. Gecco","author":"Birattari"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2013.11.008"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32373-0_6"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2009.03.001"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106418"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205511"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900380"},{"key":"ref70","volume-title":"A MIP based approach for international timetabling competition 2019","author":"Holm","year":"2019"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-022-00724-y"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-022-00728-8"},{"key":"ref73","volume-title":"Data reductions for the international timetabling competition 2019 problem","author":"Holm","year":"2022"},{"key":"ref74","first-page":"1","article-title":"International timetabling competition 2019: A mixed integer programming approach for solving university timetabling problems","volume-title":"Proc. Int. Timetabling Competition","author":"Rappos"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-021-00715-5"},{"key":"ref76","first-page":"361","article-title":"Simulated annealing with penalization for university course timetabling","volume-title":"Proc. 13th Int. Conf. Pract. Theory Automated Timetabling (PATAT)","author":"Gashi"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-022-00747-5"},{"key":"ref78","article-title":"Forest growth optimization for solving timetabling problems","volume-title":"Proc. Int. Timetabling Competition","author":"Er-rhaimini"},{"key":"ref79","article-title":"ITC-2019: A maxsat approach to solve university timetabling problems","author":"Lemos","year":"2019"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-021-00695-6"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1007\/BF01442131"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/10979955.pdf?arnumber=10979955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:32:06Z","timestamp":1746592326000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10979955\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":81,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3565522","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}