Advertisement

Data Mining with Association Rules for Scheduling Open Elective Courses Using Optimization Algorithms

  • Seba SusanEmail author
  • Aparna Bhutani
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 941)

Abstract

A new course scheduling based on mining for students’ preferences for Open Elective courses is proposed in this paper that makes use of optimization algorithms for automated timetable generation and optimization. The Open Elective courses currently running in an actual university system is used for the experiments. Hard and soft constraints are designed based on the timing and classroom constraints and minimization of clashes between teacher schedules. Two different optimization techniques of Genetic Algorithm (GA) and Simulated Annealing (SA) are utilized for our purpose. The generated timetables are analyzed with respect to the timing efficiency and cost function optimization. The results highlight the efficacy of our approach and the generated course schedules are found at par with the manually compiled timetable running in the university.

Keywords

Timetable scheduling Genetic Algorithm Simulated Annealing Data mining Students preferences 

References

  1. 1.
    Schaerf, A.: A survey of automated timetabling. Artif. Intell. Rev. 13(2), 87–127 (1999)CrossRefGoogle Scholar
  2. 2.
    Yu, E., Sung, K.-S.: A genetic algorithm for a university weekly courses timetabling problem. Int. Trans. Oper. Res. 9(6), 703–717 (2002)CrossRefGoogle Scholar
  3. 3.
    Yazdani, M., Naderi, B., Zeinali, E.: Algorithms for university course scheduling problems. Tehnicki Vjesnik-Technical Gazette 24, 241–247 (2017)Google Scholar
  4. 4.
    Duong, T.-A., Lam, K.-H.:. Combining constraint programming and simulated annealing on university exam timetabling. In: RIVF, pp. 205–210 (2004)Google Scholar
  5. 5.
    Rozaimee, A., Shafee, A.N., Hadi, N.A.A., Mohamed, M.A.: A framework for university’s final exam timetable allocation using genetic algorithm. World Appl. Sci. J. 35(7), 1210–1215 (2017)Google Scholar
  6. 6.
    Thompson, J., Dowsland, K.A.: General cooling schedules for a simulated annealing based timetabling system. In: International Conference on the Practice and Theory of Automated Timetabling, pp. 345–363. Springer, Heidelberg (1995)Google Scholar
  7. 7.
    Zheng, S., Wang, L., Liu, Y., Zhang, R.: A simulated annealing algorithm for university course timetabling considering travelling distances. Int. J. Comput. Sci. Math. 6(2), 139–151 (2015)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Brusco, M.J., Jacobs, L.W.: A simulated annealing approach to the cyclic staff-scheduling problem. Nav. Res. Logist. (NRL) 40(1), 69–84 (1993)CrossRefGoogle Scholar
  9. 9.
    Wang, Y.-T., Cheng, Y.-H., Chang, T.-C., Jen, S.M.: On the application of data mining technique and genetic algorithm to an automatic course scheduling system. In: 2008 IEEE Conference on Cybernetics and Intelligent Systems, pp. 400–405. IEEE (2008)Google Scholar
  10. 10.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference Very Large Data Bases, VLDB, vol. 1215, pp. 487–499 (1994)Google Scholar
  11. 11.
    Delhi Technological University, New Delhi, India. reg.exam.dtu.ac.in/register_all.php
  12. 12.
    Kumara, S., Goldberg, D.E., Kendall, G.: Genetic algorithms. In: Search Methodologies, pp. 93–117. Springer, Boston (2014)Google Scholar
  13. 13.
    Savasere, A., Omiecinski, E.R., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. Georgia Institute of Technology (1995)Google Scholar
  14. 14.
    Brusco, M.J., Jacobs, L.W.: A simulated annealing approach to the cyclic staff-scheduling problem. Nav. Res. Logist. (NRL) 40(1), 69–84 (1993)CrossRefGoogle Scholar
  15. 15.
    Müller, T., Rudová, H.: Real-life curriculum-based timetabling with elective courses and course sections. Ann. Oper. Res. 239(1), 153–170 (2016)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Susan, S., Sharawat, P., Singh, S., Meena, R., Verma, A., Kumar, M.: Fuzzy C-means with non-extensive entropy regularization. In: 2015 IEEE International Conference on Signal Processing, Informatics, Communication and Energy Systems (SPICES), pp. 1–5. IEEE (2015)Google Scholar
  17. 17.
    Taha, M., Nassar, H., Gharib, T., Abraham, A.: An efficient algorithm for incremental mining of temporal association rules. Data Knowl. Eng. 69, 800–815 (2010)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Information TechnologyDelhi Technological UniversityDelhiIndia

Personalised recommendations