IMPROVEMENT OF ASSIGNING TASKS METHOD FOR THE VEHICLE MAINTENANCE EMPLOYEES BASED ON GENETIC AND HUNGARIAN ALGORITHMS
DOI:
https://doi.org/10.31649/1999-9941-2023-57-2-25-32Keywords:
vehicle service station, automated system, genetic algorithm, Hungarian algorithm, task complexity, worker's qualification, service station employeeAbstract
Abstract. The method of automated process of assigning tasks to employees of vehicle service stations based on genetic and Hungarian algorithms has been improved, which, unlike existing ones, takes into account the complexity of the task, the time of task execution and the qualifications of workers, and also allows to speed up and optimize the workflow at vehicle service stations. To evaluate the optimality of solution options, a new criterion is proposed, which, in addition to the qualifications of the worker, the complexity and time of the task, allows taking into account the needs of the enterprise in different seasons. The experimental data of the proposed algorithms were computerized. The initial data for the computer experiment were taken as data on the functioning of a real service station in Vinnytsia with and without the automated application of an improved method of assigning tasks to employees of a vehicle service station based on genetic and Hungarian algorithms. Computer experiments have shown that genetic algorithm work better with a large number of tasks, and the Hungarian algorithm works better with a small number of tasks.
On the basis of the proposed improvements and algorithms, a cross-platform automated system for vehicle service station employees has been developed, which, unlike existing ones, provides instant interaction between the system's software modules, thanks to the microservice architecture and takes into account the high load of client requests, due to the horizontal scaling of the servers that host the system software. A special feature of the automated system is that it provides station employees with an automated workplace where they can manage their own tasks and monitor and control their execution, which allows vehicle service station owners to control the entire customer service process and correctly prioritize tasks for their employees.
References
A. Y. Diachuk, ta O. M. Kozachko, "Vyrishennia zadachi pro pryznachennia v modulnii informatsiinii sy-stemi stantsii tekhnichnoho obsluhovuvannia, " na Molod v nautsi: doslidzhennia, problemy, perspektyvy (MN-2019). Vinnytsia, 2019. [Elektronnyi resurs]. Rezhym dostupu: https://conferences.vntu.edu.ua/index.php/mn/mn2019/paper/viewFile/8087/6759. – [in Ukrainian].
M. R. Farzanegan, H. F. Gholipour, M. Feizi, R Nunkoo, and A. E. Andargoli, "Combinatorial Rein-forcement Learning of Linear Assignment Problems," in IEEE Intelligent Transportation Systems Conference - ITSC, 2019. doi: 10.1109/ITSC.2019.8916920.
A. Banaei, J. Alamatian, and R. Z. Tohidi, "Active control of structures using genetic algorithm with dynamic weighting factors using in the constrained objective function," Structures, vol. 47, pp. 189-200, 2023. doi: 10.1016/j.istruc.2022.11.049.
I. Younas, F. Kamrani, M. Bashir, and J. Schubert, "Efficient genetic algorithms for optimal assign-ment of tasks to teams of agents," Neurocomputing, vol. 314, pp. 409-428, 2018. doi: 10.1016/j.neucom.2018.07.008.
T. Öncan, Z. Şuvak, M. H. Akyüz, and İ. K. Altınel, "Assignment problem with conflicts," Computers & Operations Research, vol. 111, pp. 214-229, 2019. doi: 10.1016/j.cor.2019.07.001.
K. Shah, P. Reddy, and S. Vairamuthu, "Improvement in Hungarian Algorithm for Assignment Prob-lem," Artificial Intelligence and Evolutionary Algorithms in Engineering Systems, vol. 324, pp. 1-8, 2014. doi: 10.1007/978-81-322-2126-5_1.
Downloads
-
PDF (Українська)
Downloads: 105