Skip to main content
Top

2022 | OriginalPaper | Chapter

Developing an Online Examination Timetabling System Using Artificial Bee Colony Algorithm in Higher Education

Authors : Kaixiang Zhu, Lily D. Li, Michael Li

Published in: Broadband Communications, Networks, and Systems

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Educational timetabling is a fundamental problem impacting schools and universities’ effective operation in many aspects. Different priorities for constraints in different educational institutions result in the scarcity of universal approaches to the problems. Recently, COVID-19 crisis causes the transformation of traditional classroom teaching protocols, which challenge traditional educational timetabling. Especially for examination timetabling problems, as the major hard constraints change, such as unlimited room capacity, non-invigilator and diverse exam durations, the problem circumstance varies. Based on a scenario of a local university, this research proposes a conceptual model of the online examination timetabling problem and presents a conflict table for constraint handling. A modified Artificial Bee Colony algorithm is applied to the proposed model. The proposed approach is simulated with a real case containing 16,246 exam items covering 9,366 students and 209 courses. The experimental results indicate that the proposed approach can satisfy every hard constraint and minimise the soft constraint violation. Compared to the traditional constraint programming method, the proposed approach is more effective and can provide more balanced solutions for the online examination timetabling problems.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
3.
go back to reference Babaei, H., Karimpour, J., Hadidi, A.: A survey of approaches for university course timetabling problem. Comput. Ind. Eng. 86, 43–59 (2015)CrossRef Babaei, H., Karimpour, J., Hadidi, A.: A survey of approaches for university course timetabling problem. Comput. Ind. Eng. 86, 43–59 (2015)CrossRef
4.
5.
go back to reference Zhu, K., Li, L., Li, M.: A survey of computational intelligence in educational timetabling. Int. J. Mach. Learn. Comput. 11(1), 40–47 (2021)MathSciNetCrossRef Zhu, K., Li, L., Li, M.: A survey of computational intelligence in educational timetabling. Int. J. Mach. Learn. Comput. 11(1), 40–47 (2021)MathSciNetCrossRef
6.
go back to reference Appleby, J., Blake, D., Newman, E.: Techniques for producing school timetables on a computer and their application to other scheduling problems. Comput. J. 3(4), 237–245 (1961)MathSciNetCrossRef Appleby, J., Blake, D., Newman, E.: Techniques for producing school timetables on a computer and their application to other scheduling problems. Comput. J. 3(4), 237–245 (1961)MathSciNetCrossRef
7.
go back to reference Song, T., Liu, S., Tang, X., Peng, X., Chen, M.: An iterated local search algorithm for the University Course Timetabling Problem. Appl. Soft Comput. 68, 597–608 (2018)CrossRef Song, T., Liu, S., Tang, X., Peng, X., Chen, M.: An iterated local search algorithm for the University Course Timetabling Problem. Appl. Soft Comput. 68, 597–608 (2018)CrossRef
8.
go back to reference Arbaoui, T., Boufflet, J., Moukrim, A.: Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems. Comput. Oper. Res. 106, 133–142 (2019)MathSciNetCrossRef Arbaoui, T., Boufflet, J., Moukrim, A.: Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems. Comput. Oper. Res. 106, 133–142 (2019)MathSciNetCrossRef
9.
go back to reference Kahar, M., Bakar, S., Shing, L., Mandal, A.: Solving kolej poly-tech mara examination timetabling problem. Adv. Sci. Lett. 24(10), 7577–7581 (2018)CrossRef Kahar, M., Bakar, S., Shing, L., Mandal, A.: Solving kolej poly-tech mara examination timetabling problem. Adv. Sci. Lett. 24(10), 7577–7581 (2018)CrossRef
10.
go back to reference Valouxis, C., Gogos, C., Alefragis, P., Housos E.: Decomposing the high school timetable problem. In: Practice and Theory of Automated Timetabling (PATAT 2012), Son, Norway (2012) Valouxis, C., Gogos, C., Alefragis, P., Housos E.: Decomposing the high school timetable problem. In: Practice and Theory of Automated Timetabling (PATAT 2012), Son, Norway (2012)
11.
12.
go back to reference Jamili, A., Hamid, M., Gharoun, H., Khoshnoudi, R.: Developing a comprehensive and multi-objective mathematical model for university course timetabling problem: a real case study. In: Conference: Proceedings of the International Conference on Industrial Engineering and Operations Management, Paris, France (2018) Jamili, A., Hamid, M., Gharoun, H., Khoshnoudi, R.: Developing a comprehensive and multi-objective mathematical model for university course timetabling problem: a real case study. In: Conference: Proceedings of the International Conference on Industrial Engineering and Operations Management, Paris, France (2018)
13.
go back to reference Skoullis, V., Tassopoulos, I., Beligiannis, G.: Solving the high school timetabling problem using a hybrid cat swarm optimization based algorithm. Appl. Soft Comput. 52, 277–289 (2017)CrossRef Skoullis, V., Tassopoulos, I., Beligiannis, G.: Solving the high school timetabling problem using a hybrid cat swarm optimization based algorithm. Appl. Soft Comput. 52, 277–289 (2017)CrossRef
14.
go back to reference Dorneles, Á., de Araújo, O.C., Buriol, L.: A column generation approach to high school timetabling modeled as a multicommodity flow problem. Eur. J. Oper. Res. 256(3), 685–695 (2017)MathSciNetCrossRef Dorneles, Á., de Araújo, O.C., Buriol, L.: A column generation approach to high school timetabling modeled as a multicommodity flow problem. Eur. J. Oper. Res. 256(3), 685–695 (2017)MathSciNetCrossRef
15.
go back to reference Tassopoulos, I., Iliopoulou, C., Beligiannis, G.: Solving the Greek school timetabling problem by a mixed integer programming model. J. Oper. Res. Soc. 71(1), 117–132 (2020)CrossRef Tassopoulos, I., Iliopoulou, C., Beligiannis, G.: Solving the Greek school timetabling problem by a mixed integer programming model. J. Oper. Res. Soc. 71(1), 117–132 (2020)CrossRef
16.
go back to reference Leite, N., Melício, F., Rosa, A.: A fast simulated annealing algorithm for the examination timetabling problem. Expert Syst. Appl. 122, 137–151 (2019)CrossRef Leite, N., Melício, F., Rosa, A.: A fast simulated annealing algorithm for the examination timetabling problem. Expert Syst. Appl. 122, 137–151 (2019)CrossRef
17.
go back to reference June, T.L., Obit, J.H., Leau, Y.B., Bolongkikit, J.: Implementation of constraint programming and simulated annealing for examination timetabling problem. In: Alfred, R., Lim, Y., Ibrahim, A., Anthony, P. (eds.) Computational Science and Technology. LNEE, vol. 481, pp. 175–184. Springer, Singapore (2019). https://doi.org/10.1007/978-981-13-2622-6_18CrossRef June, T.L., Obit, J.H., Leau, Y.B., Bolongkikit, J.: Implementation of constraint programming and simulated annealing for examination timetabling problem. In: Alfred, R., Lim, Y., Ibrahim, A., Anthony, P. (eds.) Computational Science and Technology. LNEE, vol. 481, pp. 175–184. Springer, Singapore (2019). https://​doi.​org/​10.​1007/​978-981-13-2622-6_​18CrossRef
18.
go back to reference Güler, M., Geçici, E.: A spreadsheet-based decision support system for examination timetabling. Turk. J. Electr. Eng. Comput. Sci. 28(3), 1584–1598 (2020)CrossRef Güler, M., Geçici, E.: A spreadsheet-based decision support system for examination timetabling. Turk. J. Electr. Eng. Comput. Sci. 28(3), 1584–1598 (2020)CrossRef
19.
go back to reference Aldeeb, B., Al-Betar, A., Abdelmajeed, A., Younes, M., AlKenani, M., Alomoush, W.: A comprehensive review of uncapacitated university examination timetabling problem. Int. J. Appl. Eng. Res. 14(24), 4524–4547 (2019) Aldeeb, B., Al-Betar, A., Abdelmajeed, A., Younes, M., AlKenani, M., Alomoush, W.: A comprehensive review of uncapacitated university examination timetabling problem. Int. J. Appl. Eng. Res. 14(24), 4524–4547 (2019)
20.
go back to reference Kaur, M., Saini, S.: A review of metaheuristic techniques for solving university course timetabling problem. In: Goar, V., Kuri, M., Kumar, R., Senjyu, T. (eds.) Advances in Information Communication Technology and Computing. LNNS, vol. 135, pp. 19–25. Springer, Singapore (2021). https://doi.org/10.1007/978-981-15-5421-6_3CrossRef Kaur, M., Saini, S.: A review of metaheuristic techniques for solving university course timetabling problem. In: Goar, V., Kuri, M., Kumar, R., Senjyu, T. (eds.) Advances in Information Communication Technology and Computing. LNNS, vol. 135, pp. 19–25. Springer, Singapore (2021). https://​doi.​org/​10.​1007/​978-981-15-5421-6_​3CrossRef
21.
go back to reference Tan, J., Goh, S., Kendall, G., Sabar, N.: A survey of the state-of-the-art of optimisation methodologies in school timetabling problems. Expert Syst. Appl. 165, 113943 (2021)CrossRef Tan, J., Goh, S., Kendall, G., Sabar, N.: A survey of the state-of-the-art of optimisation methodologies in school timetabling problems. Expert Syst. Appl. 165, 113943 (2021)CrossRef
24.
go back to reference Gandomi, A., Yang, X., Talatahari, S., Alavi, A.: Metaheuristic algorithms in modeling and optimization. In: Metaheuristic Applications in Structures and Infrastructures, pp. 1–24 (2013) Gandomi, A., Yang, X., Talatahari, S., Alavi, A.: Metaheuristic algorithms in modeling and optimization. In: Metaheuristic Applications in Structures and Infrastructures, pp. 1–24 (2013)
25.
go back to reference Kim, J., Yang, H.: Effects of heuristic type on purchase intention in mobile social commerce: focusing on the mediating effect of shopping value. J. Distrib. Sci. 17(10), 73–81 (2019)CrossRef Kim, J., Yang, H.: Effects of heuristic type on purchase intention in mobile social commerce: focusing on the mediating effect of shopping value. J. Distrib. Sci. 17(10), 73–81 (2019)CrossRef
26.
go back to reference Pillay, N., Rong, Q.: Hyper-Heuristics: Theory and Applications. Springer, Cham (2018)CrossRef Pillay, N., Rong, Q.: Hyper-Heuristics: Theory and Applications. Springer, Cham (2018)CrossRef
27.
go back to reference Kouhbanani, S., Farid, D., Sadeghi, H.: Selection of optimal portfolio using expert system in mamdani fuzzy environment. Ind. Manag. Stud. 16(48), 131–151 (2018) Kouhbanani, S., Farid, D., Sadeghi, H.: Selection of optimal portfolio using expert system in mamdani fuzzy environment. Ind. Manag. Stud. 16(48), 131–151 (2018)
28.
go back to reference Bělohlávek, R., Dauben, J., Klir, G.: Fuzzy Logic and Mathematics: A Historical Perspective. Oxford University Press, Oxford (2017)CrossRef Bělohlávek, R., Dauben, J., Klir, G.: Fuzzy Logic and Mathematics: A Historical Perspective. Oxford University Press, Oxford (2017)CrossRef
29.
go back to reference Junn, K.Y., Obit, J.H., Alfred, R., Bolongkikit, J.: A formal model of multi-agent system for university course timetabling problems. In: Alfred, R., Lim, Y., Ibrahim, A., Anthony, P. (eds.) Computational Science and Technology. LNEE, vol. 481, pp. 215–225. Springer, Singapore (2019). https://doi.org/10.1007/978-981-13-2622-6_22CrossRef Junn, K.Y., Obit, J.H., Alfred, R., Bolongkikit, J.: A formal model of multi-agent system for university course timetabling problems. In: Alfred, R., Lim, Y., Ibrahim, A., Anthony, P. (eds.) Computational Science and Technology. LNEE, vol. 481, pp. 215–225. Springer, Singapore (2019). https://​doi.​org/​10.​1007/​978-981-13-2622-6_​22CrossRef
30.
go back to reference Soria-Alcaraz, J.A., et al.: Effective learning hyper-heuristics for the course timetabling problem. Eur. J. Oper. Res. 238(1), 77–86 (2014)MathSciNetCrossRef Soria-Alcaraz, J.A., et al.: Effective learning hyper-heuristics for the course timetabling problem. Eur. J. Oper. Res. 238(1), 77–86 (2014)MathSciNetCrossRef
31.
go back to reference Soria-Alcaraz, J., Ochoa, G., Swan, J., Carpio, M., Puga, H., Burke, E.: Iterated local search using an add and delete hyper-heuristic for university course timetabling. Appl. Soft Comput. 40, 581–593 (2016)CrossRef Soria-Alcaraz, J., Ochoa, G., Swan, J., Carpio, M., Puga, H., Burke, E.: Iterated local search using an add and delete hyper-heuristic for university course timetabling. Appl. Soft Comput. 40, 581–593 (2016)CrossRef
32.
go back to reference Kheiri, A., Keedwell, M.: A hidden Markov model approach to the problem of heuristic selection in hyper-heuristics with a case study in high school timetabling problems. Evol. Comput. 25(3), 473–501 (2017)CrossRef Kheiri, A., Keedwell, M.: A hidden Markov model approach to the problem of heuristic selection in hyper-heuristics with a case study in high school timetabling problems. Evol. Comput. 25(3), 473–501 (2017)CrossRef
33.
go back to reference Kasm, O., Mohandes, B., Diabat, A., Khatib, S.: Exam timetabling with allowable conflicts within a time window. Comput. Ind. Eng. 127, 263–273 (2019)CrossRef Kasm, O., Mohandes, B., Diabat, A., Khatib, S.: Exam timetabling with allowable conflicts within a time window. Comput. Ind. Eng. 127, 263–273 (2019)CrossRef
34.
go back to reference Bolaji, A., Khader, A., Al-Betar, M., Awadallah, M.: University course timetabling using hybridized artificial bee colony with hill climbing optimizer. J. Comput. Sci. 5(5), 809–818 (2014)CrossRef Bolaji, A., Khader, A., Al-Betar, M., Awadallah, M.: University course timetabling using hybridized artificial bee colony with hill climbing optimizer. J. Comput. Sci. 5(5), 809–818 (2014)CrossRef
35.
go back to reference Akkan, C., Gülcü, A.: A bi-criteria hybrid Genetic Algorithm with robustness objective for the course timetabling problem. Comput. Oper. Res. 90, 22–32 (2018)MathSciNetCrossRef Akkan, C., Gülcü, A.: A bi-criteria hybrid Genetic Algorithm with robustness objective for the course timetabling problem. Comput. Oper. Res. 90, 22–32 (2018)MathSciNetCrossRef
36.
go back to reference Sutar, S., Bichkar, R.: High school timetabling using tabu search and partial feasibility preserving genetic algorithm. Int. J. Adv. Eng. Technol. 10(3), 421 (2017) Sutar, S., Bichkar, R.: High school timetabling using tabu search and partial feasibility preserving genetic algorithm. Int. J. Adv. Eng. Technol. 10(3), 421 (2017)
37.
go back to reference Bolaji, A., Khader, A., Al-Betar, M., Awadallah, M.: A hybrid nature-inspired artificial bee colony algorithm for uncapacitated examination timetabling problems. J. Intell. Syst. 24(1), 37–54 (2015)CrossRef Bolaji, A., Khader, A., Al-Betar, M., Awadallah, M.: A hybrid nature-inspired artificial bee colony algorithm for uncapacitated examination timetabling problems. J. Intell. Syst. 24(1), 37–54 (2015)CrossRef
38.
go back to reference Fong, C., Asmuni, H., McCollum, B.: A hybrid swarm-based approach to university timetabling. IEEE Trans. Evol. Comput. 19(6), 870–884 (2015)CrossRef Fong, C., Asmuni, H., McCollum, B.: A hybrid swarm-based approach to university timetabling. IEEE Trans. Evol. Comput. 19(6), 870–884 (2015)CrossRef
40.
go back to reference June, T.L., Obit, J.H., Leau, Y.-B., Bolongkikit, J., Alfred, R.: Sequential constructive algorithm incorporate with fuzzy logic for solving real world course timetabling problem. In: Alfred, R., Lim, Y., Haviluddin, H., On, C.K. (eds.) Computational Science and Technology. LNEE, vol. 603, pp. 257–267. Springer, Singapore (2020). https://doi.org/10.1007/978-981-15-0058-9_25CrossRef June, T.L., Obit, J.H., Leau, Y.-B., Bolongkikit, J., Alfred, R.: Sequential constructive algorithm incorporate with fuzzy logic for solving real world course timetabling problem. In: Alfred, R., Lim, Y., Haviluddin, H., On, C.K. (eds.) Computational Science and Technology. LNEE, vol. 603, pp. 257–267. Springer, Singapore (2020). https://​doi.​org/​10.​1007/​978-981-15-0058-9_​25CrossRef
43.
go back to reference Tkaczyk, R., Ganzha, M., Paprzycki, M.: AgentPlanner-agent-based timetabling system. Informatica 40(1) (2016) Tkaczyk, R., Ganzha, M., Paprzycki, M.: AgentPlanner-agent-based timetabling system. Informatica 40(1) (2016)
44.
go back to reference Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report-TR06, Erciyes university, Engineering Faculty, Computer (2005) Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report-TR06, Erciyes university, Engineering Faculty, Computer (2005)
45.
go back to reference Bukchin, Y., Raviv, T.: Constraint programming for solving various assembly line balancing problems. Omega 78, 57–68 (2018)CrossRef Bukchin, Y., Raviv, T.: Constraint programming for solving various assembly line balancing problems. Omega 78, 57–68 (2018)CrossRef
Metadata
Title
Developing an Online Examination Timetabling System Using Artificial Bee Colony Algorithm in Higher Education
Authors
Kaixiang Zhu
Lily D. Li
Michael Li
Copyright Year
2022
DOI
https://doi.org/10.1007/978-3-030-93479-8_7

Premium Partner