{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T14:45:32Z","timestamp":1781102732745,"version":"3.54.1"},"reference-count":51,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,4,1]]},"abstract":"<p>This paper presents an artificial bee colony algorithm (ABC) for Education Timetabling Problem (ETP). It is aimed at developing a good-quality solution for the problem. The initial population of solutions was generated using Saturation Degree (SD) and Backtracking Algorithm (BA) to ensure the feasibility of the solutions. At the improvement stage in the solution method, ABC uses neighbourhood structures iteratively within the employed and onlooker bee operators, in order to rigorously navigate the UTP search space. The technique was evaluated using curriculum-based course timetabling (CB-CTT) and Uncapacitated Examination Timetabling Problem (UETP) problem instances. The experimental results on UETP showed that the technique is comparable with other state-of-the-art techniques and provides encouraging results on CB-CTT.<\/p>","DOI":"10.4018\/jncr.2012040101","type":"journal-article","created":{"date-parts":[[2012,12,5]],"date-time":"2012-12-05T18:06:31Z","timestamp":1354730791000},"page":"1-21","source":"Crossref","is-referenced-by-count":4,"title":["Artificial Bee Colony Algorithm for Solving Educational Timetabling Problems"],"prefix":"10.4018","volume":"3","author":[{"given":"Asaju La\u2019aro","family":"Bolaji","sequence":"first","affiliation":[{"name":"Universiti Sains Malaysia, Malaysia, & University of Ilorin, Nigeria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahamad Tajudin","family":"Khader","sequence":"additional","affiliation":[{"name":"Universiti Sains Malaysia, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed Azmi","family":"Al-Betar","sequence":"additional","affiliation":[{"name":"Universiti Sains Malaysia, Malaysia, & Jadara University, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed A.","family":"Awadallah","sequence":"additional","affiliation":[{"name":"Universiti Sains Malaysia, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jncr.2012040101-0","doi-asserted-by":"crossref","unstructured":"Abdullah, S., Burke, E. K., & McCollum, B. (2007). A hybrid evolutionary approach to the university course timetabling problem. In Proceedings of the Congress on Evolutionary Computation (pp. 1764-1768).","DOI":"10.1109\/CEC.2007.4424686"},{"key":"jncr.2012040101-1","doi-asserted-by":"crossref","unstructured":"Abdullah, S., Shaker, K., McCollum, B., & McMullan, P. (2010). Dual sequence simulated annealing with round-robin approach for university course timetabling. In P. Cowling & P. Mertz (Eds.), Proceedings of the Evolutionary Computation in Combinatorial Optimization (LNCS 6022, pp. 1-10).","DOI":"10.1007\/978-3-642-12139-5_1"},{"key":"jncr.2012040101-2","unstructured":"Abdullah, S., Turabieh, H., McCollum, B., & Burke, E. K. (2010). An investigation of a genetic algorithm and sequential local search approach for curriculum-based course timetabling problems. In Proceedings of the 4th Multidisciplinary Conference on Scheduling: Theories and Applications (pp. 727-731)."},{"key":"jncr.2012040101-3","unstructured":"Al-Betar, M. A., Khader, A., & Thomas, J. (2010). A combination of metaheuristic components based on harmony search for the uncapacitated examination timetabling. In Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling, Belfast, Northern Ireland (pp. 57-80)."},{"issue":"1","key":"jncr.2012040101-4","first-page":"1","article-title":"A harmony search algorithm for university course timetabling.","volume":"194","author":"M. A.Al-Betar","year":"2008","journal-title":"Annals of Operations Research"},{"key":"jncr.2012040101-5","doi-asserted-by":"crossref","unstructured":"Al-Betar, M. A., Khader, A. T., & Nadi, F. (2010). Selection mechanisms in memory consideration for examination timetabling with harmony search. In Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (pp. 1203-1210).","DOI":"10.1145\/1830483.1830702"},{"issue":"17","key":"jncr.2012040101-6","first-page":"4264","article-title":"Artificial bee colony search algorithm for examination timetabling problems.","volume":"6","author":"M.Alzaqebah","year":"2011","journal-title":"International Journal of the Physical Sciences"},{"key":"jncr.2012040101-7","doi-asserted-by":"crossref","unstructured":"Alzaqebah, M., & Abdullah, S. (2011b). Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems. In Proceedings of the 5th International Conference on Combinatorial Optimization and Applications (pp. 31-45).","DOI":"10.1007\/978-3-642-22616-8_3"},{"key":"jncr.2012040101-8","doi-asserted-by":"crossref","unstructured":"Bolaji, A. L., Khader, A. T., Al-Betar, M. A., & Awadallah, M. A. (2011). An improved artificial bee colony for course timetabling. In Proceedings of the Sixth International Conference on Bio-Inspired Computing: Theories and Applications (pp. 9-14).","DOI":"10.1109\/BIC-TA.2011.74"},{"key":"jncr.2012040101-9","doi-asserted-by":"crossref","unstructured":"Burke, E., & Bykov, Y. (2006). Solving exam timetabling problems with the flex-deluge algorithm. In Proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling, Brno, Czech Republic (pp. 370-372).","DOI":"10.1007\/978-3-540-77345-0"},{"key":"jncr.2012040101-10","doi-asserted-by":"publisher","DOI":"10.1080\/07408170490438410"},{"key":"jncr.2012040101-11","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23529-9_6"},{"key":"jncr.2012040101-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.01.044"},{"key":"jncr.2012040101-13","first-page":"1","article-title":"A branch-and-cut procedure for the Udine course timetabling problem.","volume":"\u25aa\u25aa\u25aa","author":"E. K.Burke","year":"2008","journal-title":"Annals of Operations Research"},{"key":"jncr.2012040101-14","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00069-3"},{"key":"jncr.2012040101-15","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-010-0737-7"},{"issue":"3","key":"jncr.2012040101-16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1057\/jors.1996.37","article-title":"Examination timetabling: Algorithmic strategies and applications.","volume":"47","author":"M. W.Carter","year":"1996","journal-title":"The Journal of the Operational Research Society"},{"key":"jncr.2012040101-17","unstructured":"Clark, M., Henz, M., & Love, B. (2008). QuikFix. A repair-based timetable solver. In Proceedings of the Seventh Practice and Theory of Automated Timetabling Conference."},{"key":"jncr.2012040101-18","doi-asserted-by":"crossref","unstructured":"C\u00f4t\u00e9, P., Wong, T., & Sabourin, R. (2005). A hybrid multi-objective evolutionary algorithm for the uncapacitated exam proximity problem. In Proceedings of the 5th Practice and Theory of Automated Timetabling Conference (pp. 294-312).","DOI":"10.1007\/11593577_17"},{"key":"jncr.2012040101-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.01.043"},{"key":"jncr.2012040101-20","unstructured":"De Cesco, F., Di Gaspero, L., & Schaerf, A. (2008). Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, and results. In Proceedings of the 7th Practice and Theory of Automated Timetabling Conference."},{"key":"jncr.2012040101-21","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-005-9032-z"},{"key":"jncr.2012040101-22","doi-asserted-by":"crossref","unstructured":"Eley, M. (2006). Ant algorithms for the exam timetabling problem. In Proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling (pp. 364-382).","DOI":"10.1007\/978-3-540-77345-0_23"},{"key":"jncr.2012040101-23","doi-asserted-by":"crossref","unstructured":"Geiger, M. (2009). Multi-criteria curriculum-based course timetabling - A comparison of a weighted sum and a reference point based approach. In M. Ehrgott, C. M. Fonseca, X. Gandibleux, J.-K. Hao, & M. Sevaux (Eds.), Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization (LNCS 5467, pp. 290-304).","DOI":"10.1007\/978-3-642-01020-0_25"},{"issue":"1","key":"jncr.2012040101-24","first-page":"1","article-title":"Applying the threshold accepting metaheuristic to curriculum based course timetabling.","volume":"194","author":"M.Geiger","year":"2010","journal-title":"Annals of Operations Research"},{"key":"jncr.2012040101-25","doi-asserted-by":"crossref","unstructured":"Goltz, H. J., & Matzke, D. (1998). University timetabling using constraint logic programming. In G. Gupta (Eds.), Proceedings of the First International Workshop on Practical Aspects of Declarative Languages (LNCS 1551, pp. 320-334).","DOI":"10.1007\/3-540-49201-1_22"},{"key":"jncr.2012040101-26","author":"D. S.Johnson","year":"1979","journal-title":"Computers and intractability: A guide to the theory of NP-completeness"},{"key":"jncr.2012040101-27","unstructured":"Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization (Tech. Rep. No. TR06). Erciyes, Turkey: Erciyes University Press."},{"key":"jncr.2012040101-28","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9149-x"},{"key":"jncr.2012040101-29","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-010-0700-7"},{"key":"jncr.2012040101-30","doi-asserted-by":"crossref","unstructured":"Landa-Silva, D., & Obit, J. (2009). Evolutionary non-linear great deluge for university course timetabling. In Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems (pp. 269-276).","DOI":"10.1007\/978-3-642-02319-4_32"},{"key":"jncr.2012040101-31","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-007-0097-0"},{"key":"jncr.2012040101-32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.12.007"},{"key":"jncr.2012040101-33","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9128-0"},{"key":"jncr.2012040101-34","unstructured":"Malim, M. R., Khader, A. T., & Mustafa, A. (2006). Artificial immune algorithms for university timetabling. In Proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling, Brno, Czech Republic."},{"key":"jncr.2012040101-35","unstructured":"McCollum, B. (2010). A simulated annealing hyper-heuristic for university course timetabling problem. Retrieved from http:\/\/www.google.com\/url?sa=t&rct=j&q=a%20simulated%20annealing%20hyper-heuristic%20for%20university%20course%20timetabling%20problem&source=web&cd=1&ved=0CDUQFjAA&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.66.2203%26rep%3Drep1%26type%3Dpdf&ei=BUWFUMrWBubI0AGDzIGABQ&usg=AFQjCNEkgr-DmTGPLfJ_W0K__hX0lfFhpQ"},{"key":"jncr.2012040101-36","unstructured":"McCollum, B. (2010). A Simulated annealing Hyper-Heuristic for University Course Timetabling Problem. appear in the School of Electronics, Electrical Engineering and Computer Science Collection http:\/\/qcite.qub.ac.uk\/handle\/123456789\/20781."},{"key":"jncr.2012040101-37","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0644-y"},{"key":"jncr.2012040101-38","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1078-5"},{"key":"jncr.2012040101-39","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0077-5"},{"key":"jncr.2012040101-40","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006576209967"},{"key":"jncr.2012040101-41","doi-asserted-by":"crossref","unstructured":"Shaker, K., & Abdullah, S. (2009). Incorporating great deluge approach with kempe chain neighbourhood structure for curriculum-based course timetabling problems. In Proceedings of the 2nd Conference on Data Mining and Optimization (pp. 149-153).","DOI":"10.1109\/DMO.2009.5341894"},{"key":"jncr.2012040101-42","unstructured":"Sheau Fen Ho, I., Safaai, D., & Hashim, S. (2009). A study on PSO-based university course timetabling problem. In Proceedings of the International Conference on Advanced Computer Control (pp. 648-651)."},{"key":"jncr.2012040101-43","doi-asserted-by":"crossref","unstructured":"Socha, K., Sampels, M., & Manfrin, M. (2003). Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. In S. Cagnoni, C. G. Johnson, J. J. R. Cardalda, E. Marchiori, D. W. Corne, J.-A. Meyer et al. (Eds.), Proceedings of the EvoWorkshops on Applications of Evolutionary Computing (LNCS 2611, pp. 334-345).","DOI":"10.1007\/3-540-36605-9_31"},{"key":"jncr.2012040101-44","unstructured":"Teodorovi\u0107, D., & Dell\u2019Orco, M. (2005). Bee colony optimization\u2013A cooperative learning approach to complex transportation problems. In Proceedings of the 10th Meeting of the EURO Working Group in Advanced OR and AI Methods in Transportation, Poznan, Poland (pp. 51-60)."},{"key":"jncr.2012040101-45","doi-asserted-by":"crossref","unstructured":"Thanh, N. D. (2007). Solving timetabling problem using genetic and heuristic algorithms. In Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel\/Distributed Computing (pp. 472-477).","DOI":"10.1109\/SNPD.2007.464"},{"key":"jncr.2012040101-46","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00101-9"},{"key":"jncr.2012040101-47","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2010.12.005"},{"key":"jncr.2012040101-48","doi-asserted-by":"crossref","unstructured":"White, G., & Xie, B. (2001). Examination timetables and tabu search with longer-term memory. In E. Burke & W. Erben (Eds.), Proceedings of the 3rd International Conference on Practice and Theory of Automated Timetabling (LNCS 2079, pp. 85-103).","DOI":"10.1007\/3-540-44629-X_6"},{"key":"jncr.2012040101-49","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00100-0"},{"key":"jncr.2012040101-50","doi-asserted-by":"crossref","unstructured":"Yang, X. S. (2009). Firefly algorithms for multimodal optimization. In Proceedings of the 5th International Conference on Stochastic Algorithms: Foundations and Applications (pp. 169-178).","DOI":"10.1007\/978-3-642-04944-6_14"}],"container-title":["International Journal of Natural Computing Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=73011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T14:12:27Z","timestamp":1654092747000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jncr.2012040101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,4,1]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jncr.2012040101","relation":{},"ISSN":["1947-928X","1947-9298"],"issn-type":[{"value":"1947-928X","type":"print"},{"value":"1947-9298","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,1]]}}}