Applying of genetic algorithms in the automated workload distribution system for teachers and students

2018;
: pp. 149 - 157
1
Lviv Polytechnic National University, Computer Aided Design Systems Department
2
Lviv Polytechnic National University, Computer Engineering Department

There was determined the relevance of the automated formation of the education schedule, which is the key to effective organization of the educational process, distribution of workload for teachers, accounting for various types of classes and relevant rooms. Analyzed the features of existing scheduling systems, their specifics. Considered the methods and approaches to solving the problemof automated distribution capacity.

Investigated features of genetic algorithms, their advantages for solving optimization problems and a possibility of using for the implementation of an automated system of distribution capacity in an academy. Proposed the modified genetic algorithm that implements the best qualities of the classical algorithm and lacks some of its limitations. Determined main parameters of the genetic algorithmand taken into account their influence on the speed and quality of the final result is. Submitted a mathematical formulation of the general distribution problem and developed the model of an automated system of distribution capacity, which implements a method for compiling a schedule focused on the organization of the educational process. The final application is implemented in Java and is provided for use as a web service. This view provides the possibility of remote access users to information resources. Managing the parameters of the algorithmmade in the configuration files, allows for more efficient use and making optimization changes to its work.

  1. Budilovskyi D. M. Optymizatsiia vyrishennia zavdan teorii rozkladiv na osnovi evoliutsiinohenetychnoi modeli rozpodilu zavdan. – Rostov-na-Donu, 2007. – 200 s.
  2. Lopateeva O. M. Systema avtomatyzovanoho formuvannia navchalnoho rozkladu u vyshchomu navchalnomu zakladi na osnovi evrystychnykh alhorytmiv. Dysertatsiina robota. – Krasnoiarsk, 2006.
  3. Sekirin A. I. Prohramnyi kompleks dlia modeliuvannia, analizu ta optymizatsii roboty avtomatyzovanykh tekhnolohichnykh kompleksiv obrobky. Naukovi pratsi Donetskoho natsionalnoho tekhnichnoho universytetu. Obchysliuvalna tekhnika ta avtomatyzatsiia. Vypusk 90 – Donetsk, 2010.
  4. Nizamova H. F. Matematychne i prohramne zabezpechennia skladannia rozkladu navchalnykh zaniat na osnovi ahrehatnykh henetychnykh alhorytmiv. Referat – Kharkiv, 2012.
  5. Prohrama “Rektor–VNZ”. [Elektronnyi resurs]. – Rezhym dostupu: http://rector.spb.ru/raspisanie–vuz–4u.
  6. Prohrama “Avtomatyzovane skladannia rozkladiv. Universytet”. [Elektronnyi resurs].–Rezhym dostupu: http://www.bgs–solutions.com.ua/prices/price.
  7. Prohrama “Halaktyka – Rozklad zaniat”. [Elektronnyi resurs]. – Rezhym dostupu: http://galaktika.ua.
  8. Bezuhlyi M. O., Sekirin O. I. Metody pidvyshchennia efektyvnosti skladannia rozkladu v umovakh navchalnoho zakladu. Mizhnarodna naukovo–tekhnichna konferentsiia studentiv, aspirantiv ta molodykh vchenykh “Kompiuterna ta prohramna inzheneriia”. – Donetskyi natsionalnyi tekhnichnyi universytet, 2015.
  9. Bevz S. V. Rozrobka avtomatyzovanoi systemy formuvannia rozkladu mahistratury. Informatsiini tekhnolohii ta kompiuterna tekhnika No 4, 2009. – 30–65 s.
  10. Babkina T. S. Zadacha skladannia rozkladu: rishennia na osnovi bahatoahentnoho pidkhodu. Biznes-informatyka. – 2008. – No 1. – S. 23–28.
  11. Snytiuk V. Ie. Pro osoblyvosti formuvannia tsilovoi funktsii ta obmezhen v zadachi skladannia rozkladu zaniat. Snytiuk V. Ie., Sipko Ye. N. // Matematychni mashyny i systemy – 2014.
  12. Dэvyd Kheffelfynher. Razrabotka prylozhenyi Java EE 6 v NetBeans 7. DMK Press, 2013. – 330 s.
  13. Konkova I.S. Henetychni alhorytmy v rishenni zavdannia skladannia rozkladu v vuzi. // Problemy informatyky v osviti, upravlinni, ekonomitsi i tekhnitsi: Zb. statei XII Mizhnar. Naukovo–tekhn. Konf. – Penza: PDZ, 2012. – S. 26–29.