Моделирование алгоритмов маршрутизации ad-hoc-сетей с использованием агентных технологий
The article describes the approach to the school timetable compilation based on genetic algorithms. Schedule requirements are divided into two categories: critical, the failure of which leads to the appearance of an incorrect, impracticable schedule, and user, allowing to consider the individual preferences of teachers and features of a school. Critical schedule requirements are described by graph theory language, which allows the use of standard genetic operators without causing many non-viable individuals. User requirements are described in the form of a flexibly adjustable fitness function, which makes it possible to quickly adapt the proposed algorithm to the conditions of a particular educational institution. The algorithm is implemented as a program for the school timetable compilation. The article presents the real data testing results, shows the correctness and advantages of the proposed approach, and marks the development trends.