{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:49:24Z","timestamp":1781110164228,"version":"3.54.1"},"reference-count":27,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,1]]},"abstract":"<p>Course time-table generation (CTTG) is a combinatorial optimization problem which largely fits into the family of scheduling problems. It attempts to schedule a number of subjects to particular time slots in an order to satisfy multiple numbers of constraints. A solution of CTTG generates a weekly schedule for each course satisfying several constraints regarding the order of classes, preference of teachers, and other institutional constraints. Automated generation of the course timetable is a problem of optimization that requires satisfying maximum constraints and can be solved with a search-based optimization technique. This article proposes a novel hybrid Cuckoo search approach for solving the Course Time-Table Generation (CTTG) problem for high schools affiliated to the West Bengal Board of Secondary Education (WBBSE), India. The authors investigate the performance of local search Hill climbing against the population-based basic Cuckoo search algorithm on the problem. Thereafter they propose a hybrid Cuckoo search technique that improves the performance significantly showed by ANOVA.<\/p>","DOI":"10.4018\/ijamc.2020100110","type":"journal-article","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T09:13:52Z","timestamp":1599729232000},"page":"214-230","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Cuckoo Search Approach for Course Time-Table Generation Problem"],"prefix":"10.4018","volume":"11","author":[{"given":"Subhasis","family":"Mallick","sequence":"first","affiliation":[{"name":"B.P. Poddar Institute of Management and Technology, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dipankar","family":"Majumdar","sequence":"additional","affiliation":[{"name":"RCC Institute of Information Technology, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8211-0507","authenticated-orcid":true,"given":"Soumen","family":"Mukherjee","sequence":"additional","affiliation":[{"name":"RCC Institute of Information Technology, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arup Kumar","family":"Bhattacharjee","sequence":"additional","affiliation":[{"name":"RCC Institute of Information Technology, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJAMC.2020100110-0","author":"E.Aarts","year":"1997","journal-title":"Local Search in Combinatorial Optimization"},{"issue":"1","key":"IJAMC.2020100110-1","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":"M. A.Al-Betar","year":"2012","journal-title":"Annals of Operations Research"},{"key":"IJAMC.2020100110-2","doi-asserted-by":"publisher","DOI":"10.4018\/IJAMC.2017070102"},{"issue":"1","key":"IJAMC.2020100110-3","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1109\/TSMCB.2011.2164245","article-title":"Hybrid ant colony-genetic algorithm (GAAPI) for global continuous optimization.","volume":"42","author":"I.Ciornei","year":"2011","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics"},{"key":"IJAMC.2020100110-4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61794-9_66"},{"key":"IJAMC.2020100110-5","doi-asserted-by":"publisher","DOI":"10.1111\/1475-3995.00383"},{"issue":"17","key":"IJAMC.2020100110-6","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1002\/tal.1033","article-title":"Design optimization of truss structures using cuckoo search algorithm.","volume":"22","author":"A. H.Gandomi","year":"2013","journal-title":"Structural Design of Tall and Special Buildings"},{"key":"IJAMC.2020100110-7","author":"H. H.Hoos","year":"2004","journal-title":"Stochastic Local Search: Foundations and Applications"},{"key":"IJAMC.2020100110-8","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2796556"},{"issue":"6","key":"IJAMC.2020100110-9","first-page":"2367","article-title":"Hybrid artificial bee colony algorithm for global numerical optimization","volume":"8","author":"X.Kong","year":"2012","journal-title":"Journal of Computer Information Systems"},{"key":"IJAMC.2020100110-10","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-007-0097-0"},{"issue":"3-4","key":"IJAMC.2020100110-11","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1007\/s00521-014-1577-1","article-title":"An effective hybrid cuckoo search algorithm for constrained global optimization.","volume":"25","author":"W.Long","year":"2014","journal-title":"Neural Computing & Applications"},{"key":"IJAMC.2020100110-12","unstructured":"Mahar, K. (2006). Automatic Generation of University Timetables: An Evolutionary Approach. Proceedings of theIADIS International Conference Applied Computing. Academic Press."},{"key":"IJAMC.2020100110-13","article-title":"Cuckoo Search Algorithm for constraint satisfaction and optimization","author":"S.Mallick","year":"2016","journal-title":"Proc of the IEEE Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)"},{"key":"IJAMC.2020100110-14","doi-asserted-by":"publisher","DOI":"10.1109\/ICECDS.2017.8389792"},{"issue":"2","key":"IJAMC.2020100110-15","first-page":"255","article-title":"A survey of simulated annealing methodology for university course timetabling","volume":"1","author":"M.Nandhini","year":"2009","journal-title":"International Journal of Recent Trends in Engineering"},{"key":"IJAMC.2020100110-16","doi-asserted-by":"publisher","DOI":"10.5120\/ijais2016451553"},{"key":"IJAMC.2020100110-17","doi-asserted-by":"publisher","DOI":"10.4018\/IJAMC.2017100106"},{"key":"IJAMC.2020100110-18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006576209967"},{"key":"IJAMC.2020100110-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.09.098"},{"key":"IJAMC.2020100110-20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45724-0_1"},{"key":"IJAMC.2020100110-21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13826-8-4"},{"key":"IJAMC.2020100110-22","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.30.12.1473"},{"key":"IJAMC.2020100110-23","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2691660"},{"key":"IJAMC.2020100110-24","author":"X. S.Yang","year":"2010","journal-title":"Nature-inspired metaheuristic algorithms"},{"key":"IJAMC.2020100110-25","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/NABIC.2009.5393690","article-title":"Cuckoo search via L\u00e9vy flights.","author":"X. S.Yang","year":"2009","journal-title":"Proceedings of the 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)"},{"issue":"4","key":"IJAMC.2020100110-26","first-page":"330","article-title":"Engineering optimisation by cuckoo search","volume":"1","author":"X. S.Yang","year":"2010","journal-title":"Int. J. Math. Model. Numer. Optim."}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=262136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T11:12:12Z","timestamp":1674817932000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJAMC.2020100110"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2020,10,1]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,10]]}},"URL":"https:\/\/doi.org\/10.4018\/ijamc.2020100110","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,1]]}}}