Automation of Scheduling Training Sessions in Educational Institutions using Genetic Algorithms

被引:0
作者
Fedkin, Evgenii [1 ]
Denissova, Natalya [1 ]
Krak, Iurii [2 ]
Dyomina, Irina [1 ]
机构
[1] D Serikbayev East Kazakhstan Tech Univ, Ust Kamenogorsk, Kazakhstan
[2] Taros Shevchenko Natl Univ Kyiv, Kiev, Ukraine
来源
PROCEEDINGS OF THE THE 11TH IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT DATA ACQUISITION AND ADVANCED COMPUTING SYSTEMS: TECHNOLOGY AND APPLICATIONS (IDAACS'2021), VOL 1 | 2021年
关键词
class schedule; schedule optimization; hard constraints; soft constraints; genetic algorithm; mutation; crossover; IMPLEMENTATION;
D O I
10.1109/IDAACS53288.2021.9660939
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In connection with the improvement of the university management system based on information and communication technologies, the problem of automating the scheduling of training sessions is becoming more and more challenging issue. The solution to this problem depends on the specifics of a particular educational institution and requires the availability of "flexible" methods and algorithms. In addition, the development of information and communication technologies has led to the development of such a direction as distance learning which is especially valuable during the coronavirus pandemic. Taking into account the development and implementation of distance learning in conjunction with traditional training at the university, the task was set to combine the training schedule for two different forms of training. This article describes the development and implementation of the compilation and optimization of the schedule for semester classes in universities based on a genetic algorithm. For this algorithm, various stages of work are defined and implemented: the initial and output data for scheduling are determined, the constraints imposing on schedules are determined, the fitness function is determined based on the weight coefficients of the constraints, the rules of the genetic algorithm at various stages of its work are determined - the generation of the initial population, crossover operator and mutation operators, conditions for selecting individuals and condition for completing the algorithm work and selecting the final schedule.
引用
收藏
页码:278 / 283
页数:6
相关论文
共 17 条
  • [1] A hybrid metaheuristic approach to the university course timetabling problem
    Abdullah, Salwani
    Turabieh, Hamza
    McCollum, Barry
    McMullan, Paul
    [J]. JOURNAL OF HEURISTICS, 2012, 18 (01) : 1 - 23
  • [2] A Heuristics Approach for Classroom Scheduling Using Genetic Algorithm Technique
    Ahmad, Izah R.
    Sufahani, Suliadi
    Ali, Maselan
    Razali, Siti N. A. M.
    [J]. INTERNATIONAL SEMINAR ON MATHEMATICS AND PHYSICS IN SCIENCES AND TECHNOLOGY 2017 (ISMAP 2017), 2018, 995
  • [3] Arias-Osorio Javier, 2020, Dyna rev.fac.nac.minas, V87, P47, DOI 10.15446/dyna.v87n215.85933
  • [4] A Brief Review on the Features of University Course Timetabling Problem
    Aziz, Nurul Liyana Abdul
    Aizam, Nur Aidya Hanum
    [J]. PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON APPLIED SCIENCE AND TECHNOLOGY (ICAST'18), 2018, 2016
  • [5] Bei Wang, 2019, Journal of Physics: Conference Series, V1325, DOI 10.1088/1742-6596/1325/1/012157
  • [6] Bykovyy P, 2007, INT WORKSH INT DATA, P634
  • [7] Dobrynin V., 2011, SYSTEM ANAL SCI ED, P12
  • [8] Jain A., 2015, INT J ADV RES COMPUT, V4, P159
  • [9] Kumargazhanova Saule, 2019, 2019 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON). Proceedings, P0020, DOI 10.1109/SIBIRCON48586.2019.8958249
  • [10] Mazumder M. M. R., 2020, INT J COMPUTING, V19, P480, DOI [10.47839/ijc.19.3.1897, DOI 10.47839/IJC.19.3.1897]