Benkalai Imène, Séguin Sara, Tremblay Hugo et Glangine Geoffrey. (2020). Computing a lower bound for the solution of a robotic process automation (RPA) problem using network flows. Dans : 7th International Conference on Control, Decision and Information Technologies (CoDIT) , June 29-July 2, 2020, Prague, Czech Republic.
Prévisualisation |
PDF
- Version acceptée
261kB |
Résumé
Robotic process automation (RPA) helps companies reduce the time required to process tasks by using software or robots to mimic human actions on graphic interfaces. In this paper, the RPA problem is solved for a financial institution. A set of different types of financial transactions are to be processed with different processing times, volumes, market hours and clearance delays. In a previous work, a two-phase linear integer model was used to solve the problem on small instances. In this study, a network flow algorithm is used to compute a lower bound for the problem, thus reducing the computational time required to obtain a solution. The method is tested on a real case provided by a bank in North America and on synthetic test cases containing a greater number of transaction types. Results show that combining the computation of the lower bound with a linear integer model is faster and more practical.
Type de document: | Matériel de conférence (Non spécifié) |
---|---|
Date: | 2020 |
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 |
Liens connexes: | |
Mots-clés: | Robotic process automation, integer programming, network flows, optimization, robots |
Déposé le: | 14 déc. 2020 23:12 |
---|---|
Dernière modification: | 14 déc. 2020 23:12 |
Éditer le document (administrateurs uniquement)