Journals / Sigma Mühendislik ve Fen Bilimleri Dergisi / 2019 / Cilt: 37 - Sayı: 2

HIERARCHICAL MATHEMATICAL MODELLING APPROACH FOR A CASE STUDY IN UNIVERSITY TIMETABLING

Pages
323–339
Publication Date
2019-06-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Proposed approach is tested 2015-2016 academic year winter term data of Atatürk University Engineering Faculty and obtained results are presented comparatively with results obtained from manual preparation in terms of seven objectives.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:This work presents a mathematical modelling based approach including many constraints encountered at Universities in Turkey.
📊
Key Findings & Data:In general, in this paper it is aimed to design compatible and flexible approach to generate timetable so as to meet all the requirements of Turkish universities.
💡
Conclusion & Impact:Proposed approach is tested 2015-2016 academic year winter term data of Atatürk University Engineering Faculty and obtained results are presented comparatively with results obtained from manual preparation in terms of seven objectives.
🔬Design:Review & Systematic Survey
📍Scope:2015-2016 Verileri
⚙️Variables:University timetabling · operational research · mathematical programming.

Abstract

This work presents a mathematical modelling based approach including many constraints encountered at Universities in Turkey. As in many other countries also in Turkey it appears that universities are too autonomous, and they have medley of individual requirements and constraints. This condition makes it very difficult to suggest a generalized model and a solution algorithm for university timetabling problem (UTP). In general, in this paper it is aimed to design compatible and flexible approach to generate timetable so as to meet all the requirements of Turkish universities. First, by reviewing the studies in which mathematical modelling approaches were used, comprehensive information about the subject has been presented. Then, proposed hierarchical mathematical modelling approach is described (HMMA). Since (UTP) is highly context-dependent the results of this study couldn’t been compared to those of the studies which are published already. Proposed approach is tested 2015-2016 academic year winter term data of Atatürk University Engineering Faculty and obtained results are presented comparatively with results obtained from manual preparation in terms of seven objectives.

🔖

Cite This Article

DEMİR, Y., ÇELİK, C. (2019). HIERARCHICAL MATHEMATICAL MODELLING APPROACH FOR A CASE STUDY IN UNIVERSITY TIMETABLING. Sigma Mühendislik ve Fen Bilimleri Dergisi, Cilt: 37 - Sayı: 2, 323–339. https://ajindex.com/articles/419345

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (13)

  1. Alvarez-Valdes, R., Crespo, E., and Tamarit, J.M. (2002). Design and implementation of a course scheduling system using Tabu Search, European Journal of Operational Research, 137, 512–523
  2. Cooper, T.B., and Kingston, J.H. (1996). The complexity of timetable construction problems. Practice and Theory of Automated Timetabling Lecture Notes in Computer Science, 1153, 281-295
  3. Al-Milli N. (2010) Hybrid genetic algorithms with great deluge for course timetabling. International Journal of Computer Science and Network Security, 10(4), 283-288
  4. Burke E.K., McCollum B., Meisels A., Petrovic S., and Qu R. (2007) A graph-based hyper-heuristic for educational timetabling problems. European Journal of Operational Research, 176, 177–192
  5. Chiarandini M., Birattari, M., Socha K., and Rossi-Doria O. (2006) An effective hybrid algorithm for university course timetabling. Journal of Scheduling, 9, 403-432
  6. Lewis R., Paechter B. and McCollum B. (2007) Post enrolment based course timetabling: A description of the problem model used for track two of the second international timetabling competition, Cardiff Accounting and Finance Working Papers A2007/3, Cardiff University, Wales. ISSN: 1750-6658, v1.0
  7. Nothegger C., Mayer A., Chwatal A. and Raidl,G.R. (2012) Solving the post enrolment course timetabling problem by ant colony optimization, Annals of Operations Research, 194, 325-339
  8. Socha K., Knowles J. and Sampels M. (2002). A MAX-MIN ant system for the university course timetabling problem, Proceedings of the 3rd International Workshop on Ant Algorithms Lecture Notes in Computer Science, 2463, 1-13
  9. Kristiansen S., Sørensen M. and Stidsen T.R. (2011) Elective course planning. European Journal of Operational Research, 215, 713-720
  10. Ceschia S., Di Gaspero L. and Schaerf A. (2012) Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Computers & Operations Research, 39, 1615-1624
  11. Martin C.H. (2004) Ohio University's College of Business Uses Integer Programming to Schedule Classes. Interfaces, 34(6), 460-465
  12. Sánchez-Partida D., Martínez-Flores J.L., and Olivares-Benítez E. (2013) Modeling and solving a timetabling problem considering time windows and consecutive periods. Lecture Notes in Management Science, 5, 25-32
  13. Akkoyunlu E.A. (1972) A linear algorithm for computing the optimum university timetable. The Computer Journal, 16(4), 347-350