title: Ð£Ð½Ð¸Ð²ÐµÑÑÐ°Ð»ÑÐ½Ð°Ñ ÑÐ¸ÑÑÐµÐ¼Ð° Ð¾Ð½Ð»Ð°Ð¹Ð½ Ð¾ÑÐµÑÐµÐ´Ð¸ Ñ Ð²Ð½ÐµÐ´ÑÐµÐ½Ð¸ÐµÐ¼ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð´Ð»Ñ ÑÐ¾ÐºÑÐ°ÑÐµÐ½Ð¸Ñ Ð²ÑÐµÐ¼ÐµÐ½Ð¸ Ð¾Ð¶Ð¸Ð´Ð°Ð½Ð¸Ñ Ð¸ Ð¸Ð½Ð´Ð¸Ð²Ð¸Ð´ÑÐ°Ð»Ð¸Ð·Ð°ÑÐ¸Ð¸
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ°
titleType: Subtitle
title: Universal online queuing system with the implementation of algorithms to reduce waiting times and individualization
Creators: name: ÐÐ¸ÐºÐ¸ÑÐ¸Ð½Ð°, ÐÐ»ÐµÐºÑÐ°Ð½Ð´ÑÐ°
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2023
Subjects: ÑÐ¿ÑÐ°Ð²Ð»ÐµÐ½Ð¸Ðµ Ð¾ÑÐµÑÐµÐ´ÑÐ¼Ð¸
Ð¾Ð±ÑÑÐµÐ½Ð¸Ðµ Ñ Ð¿Ð¾Ð´ÐºÑÐµÐ¿Ð»ÐµÐ½Ð¸ÐµÐ¼
SARSA
Ð°Ð´Ð°Ð¿ÑÐ¸Ð²Ð½ÑÐµ ÑÐ¸ÑÑÐµÐ¼Ñ
queue management
reinforcement learning
adaptive systems

description: Ð¢ÐµÐ¼Ð° Ð´Ð°Ð½Ð½Ð¾Ð¹ ÑÐ°Ð±Ð¾ÑÑ: Â«Ð£Ð½Ð¸Ð²ÐµÑÑÐ°Ð»ÑÐ½Ð°Ñ ÑÐ¸ÑÑÐµÐ¼Ð° Ð¾Ð½Ð»Ð°Ð¹Ð½ Ð¾ÑÐµÑÐµÐ´Ð¸ Ñ Ð²Ð½ÐµÐ´ÑÐµÐ½Ð¸ÐµÐ¼ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð´Ð»Ñ ÑÐ¾ÐºÑÐ°ÑÐµÐ½Ð¸Ñ Ð²ÑÐµÐ¼ÐµÐ½Ð¸ Ð¾Ð¶Ð¸Ð´Ð°Ð½Ð¸Ñ Ð¸ Ð¸Ð½Ð´Ð¸Ð²Ð¸Ð´ÑÐ°Ð»Ð¸Ð·Ð°ÑÐ¸Ð¸Â». ÐÐ±ÑÐµÐºÑÐ¾Ð¼ Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ñ ÑÐ²Ð»ÑÑÑÑÑ ÑÐ¸ÑÑÐµÐ¼Ñ Ð¾Ð½Ð»Ð°Ð¹Ð½ Ð¾ÑÐµÑÐµÐ´ÐµÐ¹. ÐÑÐµÐ´ÐµÐ¼ÐµÑ Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ñ - ÑÐ°Ñ-Ð±Ð¾Ñ Ð´Ð»Ñ Ð²Ð·Ð°Ð¸Ð¼Ð¾Ð´ÐµÐ¹ÑÑÐ²Ð¸Ñ ÐºÐ»Ð¸ÐµÐ½ÑÐ° Ð¸ ÑÐ¼Ð½Ð¾Ð¹ ÑÐ¸ÑÑÐµÐ¼Ñ ÑÐ°Ð½Ð¶Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ñ. Ð¦ÐµÐ»Ñ ÑÐ°Ð±Ð¾ÑÑ - ÑÐ¾Ð·Ð´Ð°Ð½Ð¸Ðµ ÑÐ½Ð¸Ð²ÐµÑÑÐ°Ð»ÑÐ½Ð¾Ð¹ ÑÐ¸ÑÑÐµÐ¼Ñ ÑÐ¿ÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ Ð¾Ð½Ð»Ð°Ð¹Ð½-Ð¾ÑÐµÑÐµÐ´ÑÐ¼Ð¸. ÐÐ°Ð´Ð°ÑÐ¸, ÐºÐ¾ÑÐ¾ÑÑÐµ ÑÐµÑÐ°Ð»Ð¸ÑÑ Ð² ÑÐ¾Ð´Ðµ Ð²ÑÐ¿Ð¾Ð»Ð½ÐµÐ½Ð¸Ñ ÑÐ°Ð±Ð¾ÑÑ: 1. ÐÐ·ÑÑÐ¸ÑÑ ÑÑÑÐµÑÑÐ²ÑÑÑÐ¸Ðµ Ð¼ÐµÑÐ¾Ð´Ð¸ÐºÐ¸ ÑÐ¿ÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ Ð¾ÑÐµÑÐµÐ´ÑÐ¼Ð¸ Ð¸ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð¾Ð±ÑÑÐµÐ½Ð¸Ñ Ñ Ð¿Ð¾Ð´ÐºÑÐµÐ¿Ð»ÐµÐ½Ð¸ÐµÐ¼. 2. Ð¡Ð¾Ð·Ð´Ð°ÑÑ Ð°ÑÑÐ¸ÑÐµÐºÑÑÑÑ Ð´Ð»Ñ Ð½Ð¾Ð²Ð¾Ð¹ ÑÐ¸ÑÑÐµÐ¼Ñ ÑÐ¿ÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ Ð¾ÑÐµÑÐµÐ´ÑÐ¼Ð¸. 3. ÐÑÐ¸Ð¼ÐµÐ½Ð¸ÑÑ Ð²ÑÐ±ÑÐ°Ð½Ð½ÑÐ¹ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° Ð¾Ð±ÑÑÐµÐ½Ð¸Ñ Ñ Ð¿Ð¾Ð´ÐºÑÐµÐ¿Ð»ÐµÐ½Ð¸ÐµÐ¼ Ð´Ð»Ñ ÑÐµÐ°Ð»Ð¸Ð·Ð°ÑÐ¸Ð¸ ÑÐ¸ÑÑÐµÐ¼Ñ ÑÐ¿ÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ Ð¾ÑÐµÑÐµÐ´ÑÐ¼Ð¸. 4. ÐÑÐ¾Ð²ÐµÑÑÐ¸ ÑÐµÑÑÐ¸ÑÐ¾Ð²Ð°Ð½Ð¸Ðµ Ð¸ Ð°Ð½Ð°Ð»Ð¸Ð· ÑÑÑÐµÐºÑÐ¸Ð²Ð½Ð¾ÑÑÐ¸ ÑÐ°Ð±Ð¾ÑÑ ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð½Ð¾Ð¹ ÑÐ¸ÑÑÐµÐ¼Ñ. ÐÐ»Ñ Ð²ÑÐ¿Ð¾Ð»Ð½ÐµÐ½Ð¸Ñ ÑÐ°Ð±Ð¾ÑÑ Ð±ÑÐ»Ð° ÑÐ°ÑÑÐ¼Ð¾ÑÑÐµÐ½Ð° Ð¿ÑÐ¾Ð±Ð»ÐµÐ¼Ð°ÑÐ¸ÐºÐ° ÑÐ¿ÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ Ð¾ÑÐµÑÐµÐ´ÑÐ¼Ð¸ Ð² ÑÐ°Ð·Ð»Ð¸ÑÐ½ÑÑ ÑÑÐµÑÐ°Ñ, Ð²ÐºÐ»ÑÑÐ°Ñ Ð¾Ð±ÑÐ»ÑÐ¶Ð¸Ð²Ð°Ð½Ð¸Ðµ ÐºÐ»Ð¸ÐµÐ½ÑÐ¾Ð² Ð¸ ÐºÐ¾Ð¾ÑÐ´Ð¸Ð½Ð°ÑÐ¸Ñ ÑÐµÑÐµÐ²Ð¾Ð³Ð¾ ÑÑÐ°ÑÐ¸ÐºÐ°. ÐÑÐ¾Ð²ÐµÐ´ÐµÐ½ Ð¾Ð±Ð·Ð¾Ñ Ð¸ÑÐ¿Ð¾Ð»ÑÐ·ÑÐµÐ¼ÑÑ ÑÐµÑÐ½Ð¾Ð»Ð¾Ð³Ð¸Ð¹. Ð ÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½ ÑÐ¿Ð¾ÑÐ¾Ð± ÑÐ°Ð½Ð¶Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ñ Ð¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°ÑÐµÐ»ÐµÐ¹ Ñ Ð¿ÑÐ¸Ð¼ÐµÐ½ÐµÐ½Ð¸ÐµÐ¼ Ð¼ÐµÑÐ¾Ð´Ð¾Ð² Ð¾Ð±ÑÑÐµÐ½Ð¸Ñ Ñ Ð¿Ð¾Ð´ÐºÑÐµÐ¿Ð»ÐµÐ½Ð¸ÐµÐ¼, Ð² ÑÐ°ÑÑÐ½Ð¾ÑÑÐ¸, Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° SARSA. Ð ÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½ Ð¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°ÑÐµÐ»ÑÑÐºÐ¸Ð¹ Ð¸Ð½ÑÐµÑÑÐµÐ¹Ñ Ñ Ð¿Ð¾Ð¼Ð¾ÑÑÑ Telegram API Ð´Ð»Ñ ÑÐ°Ð±Ð¾ÑÑ Ñ ÑÐ¸ÑÑÐµÐ¼Ð¾Ð¹. Ð¢Ð°ÐºÐ¶Ðµ Ð±ÑÐ»Ð° ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð° Ð°ÑÑÐ¸ÑÐµÐºÑÑÑÐ° ÑÐ¸ÑÑÐµÐ¼Ñ ÑÐ¿ÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ Ð¾ÑÐµÑÐµÐ´ÑÐ¼Ð¸ Ð¸ Ð¿ÑÐ¾Ð²ÐµÐ´ÐµÐ½ Ð°Ð½Ð°Ð»Ð¸Ð· ÐµÐµ ÑÑÑÐµÐºÑÐ¸Ð²Ð½Ð¾ÑÑÐ¸ Ð² ÑÑÐ°Ð²Ð½ÐµÐ½Ð¸Ð¸ Ñ Ð´ÑÑÐ³Ð¸Ð¼Ð¸ Ð¿Ð¾Ð¿ÑÐ»ÑÑÐ½ÑÐ¼Ð¸ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð°Ð¼Ð¸ ÑÐ°Ð½Ð¶Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ñ. Ð Ð´Ð¾Ð±Ð°Ð²Ð¾Ðº Ðº ÑÑÐ¾Ð¼Ñ Ð±ÑÐ» ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½ ÑÐ»ÑÑÑÐµÐ½Ð½ÑÐ¹ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ ÑÐ°Ð½Ð¶Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ñ Ð² ÑÐµÐ»ÑÑ ÑÑÐ°Ð²Ð½ÐµÐ½Ð¸Ñ ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð½Ð¾Ð³Ð¾ Ð½Ð° Ð±Ð°Ð·Ðµ SARSA Ð¿Ð¾Ð´ÑÐ¾Ð´Ð°. Ð ÐµÐ·ÑÐ»ÑÑÐ°ÑÐ¾Ð¼ ÑÐ°Ð±Ð¾ÑÑ ÑÐ²Ð»ÑÐµÑÑÑ ÑÐ°Ñ-Ð±Ð¾Ñ Ð½Ð° Ð¿Ð»Ð°ÑÑÐ¾ÑÐ¼Ðµ Telegram. Ð§Ð°Ñ-Ð±Ð¾Ñ Ð¿Ð¾Ð·Ð²Ð¾Ð»ÑÐµÑ Ð·Ð°ÑÐµÐ³Ð¸ÑÑÑÐ¸ÑÐ¾Ð²Ð°ÑÑÑÑ Ð² ÑÐ¸ÑÑÐµÐ¼Ðµ Ð¸ ÑÑÐ°Ð·Ñ Ð¾ÑÑÐ»ÐµÐ´Ð¸ÑÑ ÑÐ²Ð¾Ñ Ð¿Ð¾Ð·Ð¸ÑÐ¸Ñ Ð² Ð¾ÑÐµÑÐµÐ´Ð¸, Ð° ÑÐ°ÐºÐ¶Ðµ Ð¿ÐµÑÐµÐ½ÐµÑÑÐ¸ ÑÐ²Ð¾Ðµ Ð²ÑÐµÐ¼Ñ Ð¿ÑÐ¸ÐµÐ¼Ð° Ð¸Ð»Ð¸ Ð²ÑÐ¹ÑÐ¸ Ð¸Ð· Ð¾ÑÐµÑÐµÐ´Ð¸. ÐÐ¾Ð¼Ð¸Ð¼Ð¾ ÑÑÐ¾Ð³Ð¾ Ð² ÑÐ¾Ð´Ðµ ÑÐµÐ³Ð¸ÑÑÑÐ°ÑÐ¸Ð¸ Ð¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°ÑÐµÐ»Ñ Ð¼Ð¾Ð¶ÐµÑ ÑÐºÐ°Ð·Ð°ÑÑ ÑÑÐ¾Ð²ÐµÐ½Ñ ÑÐ¿ÐµÑÐºÐ¸ Ð¸ Ð´Ð¾Ð¿ÑÑÑÐ¸Ð¼Ð¾Ðµ Ð´Ð»Ñ Ð½ÐµÐ³Ð¾ Ð²ÑÐµÐ¼Ñ Ð¾Ð¶Ð¸Ð´Ð°Ð½Ð¸Ñ. Ð¡Ð¸ÑÑÐµÐ¼Ð°, ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð½Ð°Ñ Ð² ÑÐ¾Ð´Ðµ Ð²ÑÐ¿Ð¾Ð»Ð½ÐµÐ½Ð¸Ñ Ð´Ð°Ð½Ð½Ð¾Ð¹ ÑÐ°Ð±Ð¾ÑÑ Ð² Ð°Ð²ÑÐ¾Ð¼Ð°ÑÐ¸Ð·Ð¸ÑÐ¾Ð²Ð°Ð½Ð½Ð¾Ð¼ ÑÐµÐ¶Ð¸Ð¼Ðµ ÑÐ¾ÑÑÐ¸ÑÑÐµÑ Ð¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°ÑÐµÐ»ÐµÐ¹ Ñ ÑÑÐµÑÐ¾Ð¼ Ð²ÑÐµÑ Ð²ÑÑÐµ Ð¾Ð¿Ð¸ÑÐ°Ð½Ð½ÑÑ ÑÐ°ÐºÑÐ¾ÑÐ¾Ð², ÑÑÐ¾ Ð¿Ð¾Ð·Ð²Ð¾Ð»ÑÐµÑ Ð¼Ð¸Ð½Ð¸Ð¼Ð¸Ð·Ð¸ÑÐ¾Ð²Ð°ÑÑ Ð´Ð¾Ð»Ð³Ð¾Ðµ Ð¾Ð¶Ð¸Ð´Ð°Ð½Ð¸Ðµ Ð² Ð¾ÑÐµÑÐµÐ´Ð¸.
description: The topic of this paper is Â«Universal online queuing system with the implementation of algorithms to reduce waiting times and individualizationÂ». The object of the research is online queueing systems. The subject of the study is a chatbot for customer interaction and smart ranking system. The aim of the work is to create a universal online queue management system. The tasks that were solved in the course of the work were: 1. To study existing queue management techniques and reinforcement learning algorithms. 2. Create an architecture for a new queue management system. 3. Apply the selected reinforcement learning algorithm to implement the queue management system. 4. Test and analyze the effectiveness of the developed system. To perform the work we examined queue management problems in different areas, including customer service and network traffic coordination. An overview of the technologies used was carried out. Implemented a way to rank users using reinforcement learning methods, in particular, the SARSA algorithm.Â  A user interface using Telegram API to work with the system was implemented. We have also developed the architecture of queue management system and analyzed its efficiency in comparison with other popular ranking algorithms. In addition, an improved ranking algorithm was developed to compare the developed SARSA-based approach. The result is a chatbot on the Telegram platform. The chatbot allows users to register in the system and immediately track their position in the queue, as well as reschedule their appointment or get out of the queue. In addition, during registration, the user can specify the rush level and the permissible waiting time. The system developed in the course of this work in an automated mode sorts users taking into account all the factors described above, which allows to minimize long waiting time in the queue.