Generating an optimal timetabling for multi-departments common lecturers using hybrid fuzzy and clustering algorithms
- 8 Downloads
University course timetabling is a NP-hard problem that be performed for each semester frequently. In this paper, we use a two-step algorithm for timetabling of common lecturers among departments. In the first step, we use a fuzzy multi-criteria decision-making comparison and local search algorithms with seven neighborhood structures and random iteration. It means that we use a fuzzy multi-criteria comparison algorithm to eliminate the ambiguities and soft constraints of common lecturers among departments. In addition, we apply the local search algorithm with seven neighboring structures to avoid trapping into local optima and improve the fuzzy multi-criteria comparison over the preferences and soft constraints of lecturers. In the second step, the common lecturers’ timetable generated in the first step by the clustering approach (k-means, fuzzy c-means and funnel shape) is clustered based on the preferences and soft constraints of common lecturers among departments. Now, our common lecturers prepared by the clustering algorithms are mapped to the traversed free resources according to the paper’s aims: (1) descending satisfaction of preferences and soft constraints of common lecturers among departments and (2) minimizing the loss of extra resources of each faculty, so that an optimal instance of our common lecturers timetabling is generated among departments. The applied datasets are in terms of satisfying the scheduling requirements in the real world for multi-departments of Islamic Azad University of Ahar branch.
KeywordsClustering algorithms Common lecturers Fuzzy multi-criteria decision-making approach Local search University courses timetabling
This study was not funded by the Islamic Azad university of Ahar and university of Tabriz.
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest. The authors have not received grants from Islamic Azad university of Ahar and university of Tabriz.
This paper does not contain any studies with human participants or animals performed by any of the authors.
Informed consent was obtained from all individual participants included in the study.
- Babaei H, Hadidi A (2014) A review of distributed multi-agent systems approach to solve university course timetabling problem. ACSIJ Adv Comput Sci Int J 3(5):11. ISSN: 2322-5157, pp 19–28Google Scholar
- Babaei H, Karimpour J, Mavizi S (2016a) Using k-means clustering algorithm for common lecturers timetabling among departments. ACSIJ Adv Comput Sci Int J 5(1):19. ISSN: 2322-5157, pp 86–102Google Scholar
- Babaei H, Karimpour J, Oroji H (2016b) Using fuzzy \(c\)-means clustering algorithm for common lecturers timetabling among departments. In: 6th international conference on computer and knowledge engineering (ICCKE 2016), 978-1-5090-3586 IEEE, October 20–21, Ferdowsi University of MashhadGoogle Scholar
- Babaei H, Karimpour J, Hadidi A (2017a) Applying hybrid fuzzy multi-criteria decision-making approach to find the best ranking for the soft constraint weights of lecturers in UCTP. Int J Fuzzy Syst. Taiwan Fuzzy Systems Association and Springer, Berlin. https://doi.org/10.1007/s40815-017-0296-z
- Babaei H, Karimpour J, Hadidi A (2017b) Common lecturers timetabling among departments based on funnel-shape clustering algorithm. Springer, New York. https://doi.org/10.1007/s10489-016-0828-5. Applied Intelligence. 46:386–408
- Feizi-Derakhshi MR, Babaei H, Heidarzadeh J (2012) A survey of approaches for university course timetabling problem. In: Proceedings of 8th international symposium on intelligent and manufacturing systems, Sakarya University Department of Industrial Engineering, Adrasan, Antalya, Turkey, pp 307–321Google Scholar
- Hafizah AR, Zaidah I (2010) Bipartite graph edge coloring approach to course timetabling. In: 2010 international conference on information retrieval & knowledge management, (CAMP). IEEE, pp 229–234Google Scholar
- Lewis RMR (2006) Metaheuristics for university course timetabling. Ph.D. Thesis, Napier University, Napier, UKGoogle Scholar
- Mayer A, Nothegger C, Chwatal A, Raidl G (2008) Solving the post enrolment course timetabling problem by ant colony optimization. In: Proceedings of the 7th international conference on the practice and theory of automated timetablingGoogle Scholar
- Obit JH (2010) Developing novel meta-heuristic, hyper-heuristic and cooperative search for course timetabling problems. Ph.D. Thesis, School of Computer Science University of Nottingham, Nottingham, UKGoogle Scholar
- Obit JH, Landa-Silva D, Ouelhadj D, Khan Vun T, Alfred R (2011) Designing a multi-agent approach system for distributed course timetabling. In: 11th international conference on hybrid intelligence system (HIS). IEEEGoogle Scholar
- Redl TA (2004) A study of university timetabling that blends graph coloring with the satisfaction of various essential and preferential conditions. Ph.D. Thesis, Rice University, Houston, TexasGoogle Scholar
- Shahvali KM, Saniee AM (2012) Hybrid genetic algorithms for university course timetabling. IJCSI Int J Comput Sci Issues 9(2):2Google Scholar