Skip to main content
SpringerLink
Log in

Common lecturers timetabling among departments based on funnel-shape clustering algorithm

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

The university course timetabling problem is considered one of the NP-problems which should be performed for each semester repeatedly, and it is an exhausting and time consuming task. The main technique of the proposed approach is focused on extension and scalability of common lecturers timetabling process across different departments of a university. In this paper the clustering algorithms, including K-means and Fuzzy c-means, are used to schedule common lecturers between departments considering the constraints and their priorities offered, for the first time. For this purpose, a new clustering algorithm named funnel-shape clustering is proposed to schedule common lecturers between departments based on their constraints proposed. The main goals of this paper are to improve the satisfaction of common lecturers across departments and minimize the loss of resources within departments. In this method, all the departments perform their scheduling process locally; After that the clustering agent is applied to cluster common lecturers across departments by using the proposed funnel clustering algorithm and then the traversing agent is used to find the useless resources across departments. Following the clustering and traversing processes, mapping is performed based on the common lecturers’ constraints in the excess resources in order to reach the problem goals. The applied dataset based on the real world requirements is across various departments of Islamic Azad University, Ahar Branch and the results’ success would be based on uniform distribution and allocation of common lecturers on useless resources across different departments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Notes

  1. University Course TimeTabling Problem

  2. Common Lecturer TimeTabling Problem

References

  1. Abdullah S, Hamdan R (2008) A hybrid approach for university course timetabling. IJCSNS Int J Comput Sci Netw Secur 8(8)

  2. Abdullah S, Burke EK, McColloum B (2007) A hybrid evolutionary approach to the university course timetabling problem. In: Proceedings of CEC: the IEEE congress on evolutionary computation, pp 1764–1768

  3. Abdullah S, Burke EK, McColloum B (2005) An investigation of variable neighborhood search for university course timetabling. In: The 2th multidisciplinary conference on scheduling: theory and applications, NY, pp 413–427

  4. Abdullah S, Burke EK, McColloum B (2007) Using a randomised iterative improvement algorithm with composite neighborhood structures for university course timetabling. Metaheuristic – Program in Complex Systems Optimization:153–172

  5. Aladag CH, Hocaoglu G, Basaran AM (2009) The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem. Expert Syst Appl 36:12349–12356

    Article  Google Scholar 

  6. Aladag CH, Hocaoglu G (2007) The effect of neighborhood structure and of move types in the problem of course timetabling with the tabu search algorithm

  7. Al-Betar MA, Khader AT, Zaman M (2012) University course timetabling using a hybrid harmony search metaheuristic algorithm. IEEE Trans Syst Man Cybern Part C Appl Rev 42(5):664–681

    Article  Google Scholar 

  8. Alsmadi OMK, Abo-Hammour ZS, Abu-Al-Nadi DI, Algsoon A (2011) A novel genetic algorithm technique for solving university course timetabling problems. IEEE:195–198

  9. Alvarez R, Crespo E, Tamarit JM (2002) Design and implementation of a course scheduling system using tabu search. Eur J Oper Res 137:512–523

    Article  MATH  Google Scholar 

  10. Amintoosi M, Haddadnia J (2005) Fuzzy C-means clustering algorithm to group students in a course into smaller sections:147–160. LNCS 3616

  11. Asham GM, Soliman MM, Ramadan AR (2011) Trans genetic coloring approach for timetabling problem. Artificial Intelligence Techniques Novel Approaches Practical Applications IJCA:17–25

  12. Asmuni H (2008) Fuzzy methodologies for automated university timetabling solution construction and evaluation. Ph.D. thesis School of Computer Science University of Nottingham, Nottingham

    Google Scholar 

  13. Asmuni H, Burke EK, Garibaldi JM (2005) Fuzzy multiple heuristic ordering for course timetabling. In: The Proceedings of the 5th United Kingdom Workshop on Computational Intelligence (UKCI05), pp 302–309

  14. Aycan E, Ayav T (2008) Solving the course scheduling problem using simulated annealing. IEEE

  15. Ayob M, Jaradat G (2009) Hybrid ant colony systems for course timetabling problems. IEEE, Selangor

  16. Babaei H, Karimpour J, Hadidi A (2015) A survey of approaches for university course timetabling problem. Comput Ind Eng 86:43–59

    Article  Google Scholar 

  17. 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):19–28. No.11, ISSN: 2322-5157

    Google Scholar 

  18. Bakir MA, Aksop C (2008) A 0-1 integer programming approach to a university timetabling problem. Hacettepe J Math Stat 37(1):41–55

    MathSciNet  MATH  Google Scholar 

  19. Chaudhuri A, Kajal D (2010) Fuzzy genetic heuristic for university course timetable problem. Int J Advance Soft Comput Appl 2(1):ISSN: 2074-8523

    Google Scholar 

  20. Dandashi A, Al-Mouhamed M (2010) Graph coloring for class scheduling. Department of Computer Science University of Balamand, Koura

    Book  Google Scholar 

  21. Daskalaki S, Birbas T (2005) Efficient solutions for a university timetabling problem through integer programming. Eur J Oper Res 160:106–120

    Article  MATH  Google Scholar 

  22. Deris S, Omatu S, Ohta H (2000) Timetable planning using the constraint-based reasoning. Comput Oper Res 27:819–840

    Article  MATH  Google Scholar 

  23. Deris S, Omatu S, Ohta H, Saada P (1999) Incorporating constraint propagation in genetic algorithm for university timetable planning. Eng Appl Artif Intell 12:241–253

    Article  Google Scholar 

  24. DeWerra D (1985) An Introduction to TimeTabling. Eur J Oper Res 19:151–162

    Article  MathSciNet  Google Scholar 

  25. 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, pp 307– 321

  26. Golabpour A, Mozdorani Shirazi H, Farahi A, Kootiani M, Beige H (2008) A fuzzy solution based on Memetic algorithms for timetabling. International Conference on Multimedia and Information Technology, IEEE, pp 108–110

  27. Gotlib CC (1963) The construction of classroomlecturer timetables. Proc IFIP Congress 62:73–77

    Google Scholar 

  28. Hafizah AR, Zaidah I (2010) Bipartite graph edge coloring approach to course timetabling. IEEE:229–234

  29. Jat NS, Shengxiang Y (2008) A memetic algorithm for the university course timetabling problem. In: 20th IEEE international conference on tools with artificial intelligence, pp 427– 433

  30. Joudaki M, Imani M, Mazhari N (2010) Using improved Memetic algorithm and local search to solve University course timetabling problem (UCTTP). Islamic Azad University, Doroud

    Google Scholar 

  31. Shahvali Kohshori M, Saniee Abadeh M, Sajedi H (2011) A fuzzy genetic algorithm with local search for university course timetabling. Department of computer science and research branch, Islamic Azad University, Khouzestan

    Google Scholar 

  32. Khonggamnerd P, Innet S (2009) On improvement of effectiveness in automatic University timetabling arrangement with applied genetic algorithm, IEEE

  33. Kostuch P (2005) The University course timetabling problem with a three-phase approach. In: Lecture Notes in Computer Science. Springer, Berlin, pp 109–125

  34. Lewis MR (2006) Metaheuristics for university course timetabling. Ph.D. thesis Napier University, Napier

    MATH  Google Scholar 

  35. 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 timetabling, pp 120–126

  36. 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

  37. Obit JH, Landa-Silva D, Ouelhadj D, Khan Vun T, Alfred R (2011) Designing a multi-agent approach system for distributed course TimeTabling. IEEE, pp 103–108

  38. Rachmawati L, Srinivasan D (2005) A hybrid fuzzy evolutionary algorithm for a multi-objective resource allocation problem. In: IEEE proceedings of the fifth international conference on hybrid intelligent systems

  39. 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, Texas

    Google Scholar 

  40. Selim SM (1988) Split vertices in vertex coloring and their application in developing a solution to the faculty timetable problem. Comput J 31(1):76–82

    Article  MathSciNet  MATH  Google Scholar 

  41. Shahvali Kohshori M, Saniee Abadeh M (2012) Hybrid genetic algorithms for university course timetabling. IJCSI Int J Comput Sci Issues 9(2). No. 2

  42. Shatnawi S, Al -Rababah K, Bani-Ismail B (2010) Applying a novel clustering technique based on FP- tree to university timetabling problem: a case study. IEEE

  43. Shengxiang Y, Jat NS (2011) Genetic algorithms with guided and local search strategies for university course timetabling. IEEE Trans Syst Man Cybern Part C Appl Rev 41(1):93–106

    Article  Google Scholar 

  44. Socha K, Knowles J, Samples M (2002) A max-min ant system for the university course timetabling problem. In: Proceedings of the 3rd international workshop on ant algorithms (ANTS 2002), Lecturer notes in computer science 2463. Springer, pp 1–13

  45. Tuga M, Berretta R, Mendes A (2007) A hybrid simulated annealing with Kempe Chain neighborhood for the university timetabling problem. In: 6th IEEE/ACIS International Conference on Computer and Information Science. ICIS

  46. Turabieh H, Abdullah S (2009) Incorporating Tabu search into Memetic approach for enrolment-based course timetabling problems. In: IEEE 2nd conference on data mining and optimization, Selangor, pp 115–119

  47. Wangmaeteekul P (2011) Using distributed agents to create university course timetables addressing essential desirable constraints and fair allocation of resources. Ph.D. Thesis School of Engineering & Computing Sciences Durham University, Durham

    Google Scholar 

  48. Welsh DJA, Powell MB (1967) An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput J 10:85–86

    Article  MATH  Google Scholar 

  49. Zhang L, Lau S (2005) Constructing university timeTable using constraint satisfaction programming approach. In: IEEE proceedings of the 2005 international conference on computational intelligence for modeling, control and automation, and international conference on intelligent agents, web technologies and internet commerce (CIMCA-IAWTIC’05), NO 2, pp 55–60

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Islamic Azad University, Ahar Branch, Ahar, Iran

    Hamed Babaei

  2. Department of Computer Sciences, University of Tabriz, Tabriz, Iran

    Jaber Karimpour

  3. Department of Mechanical Engineering, Ahar Branch, Islamic Azad University, Ahar, Iran

    Amin Hadidi

Authors
  1. Hamed Babaei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jaber Karimpour
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amin Hadidi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hamed Babaei.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Babaei, H., Karimpour, J. & Hadidi, A. Common lecturers timetabling among departments based on funnel-shape clustering algorithm. Appl Intell 46, 386–408 (2017). https://doi.org/10.1007/s10489-016-0828-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-016-0828-5

Keywords

Search

Navigation