GENERATING UNIVERSITY COURSE TIMETABLE USING CONSTRUCTIVE MODELING

Authors

  • V. I. Shinkarenko Dnipropetrovsk National University of Railway Transport named after academician V. Lazaryan, Dnipro
  • O. O. Zhevago Dnipropetrovsk National University of Railway Transport named after academician V. Lazaryan, Dnipro

DOI:

https://doi.org/10.15588/1607-3274-2019-3-17

Keywords:

Timetabling, constructor, genetic algorithm, modeling

Abstract

Context. Generating university course timetable is one of the most important tasks of managing the educational process. Growing
requirements for the quality of education, a reduction in the material base and an increase in the number of specialties lead to the
need to optimize the process of using human resources, the classroom fund and to save energy resources. Since all the factors influencing
the schedule are almost impossible to take into account and the interests of the participants in the educational process are diverse,
the task of creating a schedule is multicriteria with a fuzzy set of factors. In this regard, the problem of automating the timetabling
is still one of the urgent problems of the organization of the educational process.
Objective. The goal of the work is the improving the quality of university timetables and reducing the time it takes. The quality
of the schedule is determined by the extent to which the necessary and desirable requirements are met. It is necessary to provide possibility
of expanding the desired requirements without changing the optimizing mechanism.
Method. To describe the processes of scheduling classes applied the methodology of constructive-production modeling. From
the point of view of constructivism: on the basis of a number of structures with a given structure and content, it is necessary to complete
the construction of a schedule with a given structure and partly content. The development of the designer provides for the definition
of expandable carrier, signatures of relations and operations, as well as information support. The most difficult and essential
part is the creation of a set of substitution rules, which define the output process of the corresponding constructions.
Results. Developed a university course timetabling constructor and software that implements the proposed method.
Conclusions. The experiments confirmed the effectiveness of the proposed approach and the software that implements the proposed
method. This allows us to recommend it for use in practice in solving problems of scheduling classes.

Author Biographies

V. I. Shinkarenko, Dnipropetrovsk National University of Railway Transport named after academician V. Lazaryan, Dnipro

Dr. Sc., Professor, Head of the Department of Computer Information Technologies

O. O. Zhevago, Dnipropetrovsk National University of Railway Transport named after academician V. Lazaryan, Dnipro

Post-graduate student of the Department of Computer Information Technologies

References

Bettinelli A. , Cacchiani V., Roberti R. et al. An overview of curriculum-based course timetabling, Top, 2015, No. 2, P. 37. DOI: 10.1007/s11750-015-0366-z

Conway R. W., Maxwell W. L., Miller L. W. Theory of Scheduling. New York, Addison-Wesley, 1967, 128 p.

Hasuhadzhiev A. C. Formirovanie sistemy pokazatelej dlja avtomatizacii uchebnogo raspisanija tipovogo vuza, Vestnik AGTU. Serija: Upravlenie, vychislitel'naja tehnika i informatika, 2017, No. 3, pp. 117–127. DOI: 10.24143/2072-9502-2017-3-117-127

Gaspero L. Di, McCollum B., Schaerf A. The second international timetabling competition (ITC-2007): Curriculumbased course timetabling (track 3) : Technical Report : QUB/IEEE/Tech/ITC2007/CurriculumCTT/v1.0, Queen’s University. Belfast, 2007, 12 p.

Al-Yakoob S. M., Sherali H. D. Mathematical models and algorithms for a high school timetabling problem, Computers & Operations Research, 2015, pp. 56–68. DOI:10.1016/j.cor.2015.02.011

Lukas S., Aribowo A., Muchri M. Solving timetable problem by genetic algorithm and heuristic search case study: Universitas pelita harapan timetable. In O. Roeva, Real-World Applications of Genetic Algorithms, 2012, Vol. 378, pp. 303–316. DOI: 10.1109/ICADIWT.2009.5273979

Pillay N. A review of hyper-heuristics for educational timetabling, Annals of Operations Research, 2014, P. 36. DOI:10.1007/s10479-014 -1688-1

Subbotin S. O., Olijnyk A. O., Olijnyk O. O. Neiteratyvni, evoljucijni ta mul’tyagentni metody syntezu nechitkologichnyh i nejromerezhnyh modelej. Zaporizhzhja, ZNTU, 2009, 375 p.

Akkan C., Gülcü A. A bi-criteria hybrid Genetic Algorithm with ro-bustness objective for the course timetabling problem, Computers & Operations Research, 2018, pp. 22–32. DOI: 10.1016/j.cor.2017.09.007

Abdelhalim E. A., El Khayat G. A. A utilization-based genetic algorithm for solving the university timetabling problem (uga), Alexandria Engineering Journal, 2016, No. 2, pp. 1395–1409. DOI: 10.1016/j.aej.2016.02.017

Shynkarenko V. I., Ilman V. M. Constructive-Synthesizing Structures and Their Grammatical Interpretations. I. Generalized Formal Constructive-Synthesizing Structure, Cybernetics and Systems Analysis, 2014, Vol. 50, Issue 5, pp. 655–662. DOI: 10.1007/s10559-014-9655-z

Shynkarenko V. I., Ilman V. M., Skalozub V. V. Structural Models of Algorithms in Problems of Applied Programming. I. Formal Algorithmic Structures, Cybernetics and Systems Analysis, 2009, Vol. 45, Issue 3, pp. 329–339. DOI:10.1007/s10559-009-9118-0

Published

2019-10-01

How to Cite

Shinkarenko, V. I., & Zhevago, O. O. (2019). GENERATING UNIVERSITY COURSE TIMETABLE USING CONSTRUCTIVE MODELING. Radio Electronics, Computer Science, Control, (3), 152–162. https://doi.org/10.15588/1607-3274-2019-3-17

Issue

Section

Progressive information technologies