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

2Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Susan, S., & Bhutani, A. (2020). Data Mining with Association Rules for Scheduling Open Elective Courses Using Optimization Algorithms. In Advances in Intelligent Systems and Computing (Vol. 941, pp. 770–778). Springer Verlag. https://doi.org/10.1007/978-3-030-16660-1_75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free