Constellation, le dépôt institutionnel de l'Université du Québec à Chicoutimi

Minimizing the number of robots required for a robotic process automation (RPA) problem

Séguin Sara, Tremblay Hugo, Benkalai Imene, Perron-Chouinard David-Emmanuel et Lebeuf Xavier. (2021). Minimizing the number of robots required for a robotic process automation (RPA) problem. Procedia Computer Science, 192, p. 2689-2698.

[img]
Prévisualisation
PDF - Version publiée
Disponible sous licence Creative Commons Attribution - Pas d’utilisation commerciale - Pas de modification (CC-BY-NC-ND 2.5).

1MB

URL officielle: http://dx.doi.org/doi:10.1016/j.procs.2021.09.039

Résumé

Robotic Process Automation (RPA) is used in various fields of human activity in order to implement faster and more secure processes through a reduction in the risks or errors but also an increase in the productivity rates. The increase of its use and importance calls for evermore efficient solution methods for this problem. In this paper, the RPA is addressed in the context of a financial institution. The problem consists in assigning transactions to software robots, where each transaction type has a different clearance date and a different processing time. First, four heuristics are used to compute an upper bound on the number of required software robots. Then, this bound is given as a parameter to an integer linear program, which is used to assign the transactions to the different robots. The quality of the solutions is assessed by an extensive experimental study on a set of 39,000 instances. The results show that two heuristics outperform the others and allow for a faster resolution by the integer linear program which in turn finds the optimal solution for most of the instances within a timeout of 60 seconds.

Type de document:Article publié dans une revue avec comité d'évaluation
Volume:192
Pages:p. 2689-2698
Version évaluée par les pairs:Oui
Date:2021
Sujets:Sciences naturelles et génie > Sciences mathématiques > Informatique
Département, module, service et unité de recherche:Départements et modules > Département d'informatique et de mathématique
Mots-clés:Robotic process automation, linear integer programming, bin packing, heuristics, upper bound, proceedings
Déposé le:16 mars 2022 21:20
Dernière modification:16 mars 2022 21:20
Afficher les statistiques de telechargements

Éditer le document (administrateurs uniquement)

Creative Commons LicenseSauf indication contraire, les documents archivés dans Constellation sont rendus disponibles selon les termes de la licence Creative Commons "Paternité, pas d'utilisation commerciale, pas de modification" 2.5 Canada.

Bibliothèque Paul-Émile-Boulet, UQAC
555, boulevard de l'Université
Chicoutimi (Québec)  CANADA G7H 2B1
418 545-5011, poste 5630