{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T08:35:23Z","timestamp":1768552523847,"version":"3.49.0"},"reference-count":23,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comp. Intel. Appl."],"published-print":{"date-parts":[[2014,3]]},"abstract":"<jats:p> The university course timetabling problem is an NP-hard and NP-complete problem concerned with assigning a specific set of events and resources to timeslots under a highly-constrained search space. This paper presents a novel metaheuristic algorithm entitled adapted cuckoo optimization algorithm which is derived from the cuckoo optimization algorithm and cuckoo search algorithm. This algorithm includes features such as local random walk on discrete data which mimics the behavior of L\u00e9vy flights and an Elitism-based mechanism which echoes back the best candidate solutions and prevents the algorithm from plunging into a curse of dimensionality. The algorithm was tested on a problem instance gathered from a University in Malaysia and the results indicate that the proposed algorithm exhibits very promising results in terms of solution quality and computational speed when compared to genetic algorithms. <\/jats:p>","DOI":"10.1142\/s1469026814500023","type":"journal-article","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T02:06:05Z","timestamp":1395367565000},"page":"1450002","source":"Crossref","is-referenced-by-count":11,"title":["AN ADAPTED CUCKOO OPTIMIZATION ALGORITHM AND GENETIC ALGORITHM APPROACH TO THE UNIVERSITY COURSE TIMETABLING PROBLEM"],"prefix":"10.1142","volume":"13","author":[{"given":"CHONG KEAT","family":"TEOH","sequence":"first","affiliation":[{"name":"Department of Computer Science, Faculty of Computing, Universiti Teknologi Malaysia, 81310, UTM, Johor Bahru, Johor, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANTONI","family":"WIBOWO","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computing, Universiti Teknologi Malaysia, 81310, UTM, Johor Bahru, Johor, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MOHD. SALIHIN","family":"NGADIMAN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computing, Universiti Teknologi Malaysia, 81310, UTM, Johor Bahru, Johor, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,3,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2007.03.012"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1080\/08886504.1994.10782112"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-007-0097-0"},{"key":"rf6","unstructured":"O.\u00a0Rossi-Doria, Practice and Theory of Automated Timetabling IV\u00a02740, eds. E. K.\u00a0Burke and P.\u00a0De Causmaecker (Springer, Berlin, 2002)\u00a0pp. 329\u2013351."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.09.014"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.06.051"},{"key":"rf10","first-page":"1","volume":"2","author":"Tahar M.","journal-title":"Int. J."},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.12.007"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00099-7"},{"key":"rf13","first-page":"100","volume":"2","author":"Chaudhuri A.","journal-title":"Int. J. Adv. Soft Comput. Appl."},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.03.011"},{"key":"rf15","first-page":"446","volume":"9","author":"Kohshori M.","journal-title":"Int. J. Comput. Sci."},{"key":"rf16","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"Holland J. H.","year":"1975"},{"key":"rf17","volume-title":"Clever Algorithms: Nature-Inspired Programming Recipes","author":"Brownlee J.","year":"2011"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-011-9276-0"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.08.010"},{"key":"rf20","author":"Teoh C. K.","journal-title":"Artif. Intell. Rev."},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.05.008"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.09.026"},{"key":"rf25","first-page":"65","volume":"3","author":"Prakash M.","journal-title":"Int. J. Comput. Sci. Telecommun."},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2012.01.001"},{"key":"rf27","doi-asserted-by":"crossref","unstructured":"S.\u00a0Sivanandam and S.\u00a0Deepa, Introduction to Genetic Algorithms (Springer, 2007)\u00a0pp. 15\u201360.","DOI":"10.1007\/978-3-540-73190-0_2"},{"key":"rf28","volume-title":"Dynamic Programming","author":"Bellman R. E.","year":"1957"}],"container-title":["International Journal of Computational Intelligence and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1469026814500023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T19:33:26Z","timestamp":1565120006000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1469026814500023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":23,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2014,3,20]]},"published-print":{"date-parts":[[2014,3]]}},"alternative-id":["10.1142\/S1469026814500023"],"URL":"https:\/\/doi.org\/10.1142\/s1469026814500023","relation":{},"ISSN":["1469-0268","1757-5885"],"issn-type":[{"value":"1469-0268","type":"print"},{"value":"1757-5885","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}