Задача маршрутизації міжбанківських фінансових зобов’язань

The problem of speeding up cross-currency transfers and mutual settlements between banks with the increasing amount of national electronic currencies, cryptocurrencies, and the overall volume of financial transactions can be considered as a routing problem. The solving time of this class of combinat...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Datum:2023
Автори та афіліації:
  • Vyacheslav Korolyov — к. т. н., с.н.с. Інститут кібернетики ім. В.М. Глушкова НАН України, просп. Глушкова, 40, к. 801, 03680, Київ
  • Maksym Ogurtsov — науковий співробітник ІК НАНУ
  • Oleksandr Khodzinskyi — к. ф-м. н., с.н.с., ІК НАНУ
Ключові слова:keywords
Hauptverfasser: Korolyov, Vyacheslav, Ogurtsov, Maksym, Khodzinskyi, Oleksandr
Format: Artikel
Sprache:Ukrainisch
Veröffentlicht: Інститут прикладних проблем механіки і математики ім. Я. С. Підстригача НАН України 2023
Schlagworte:
Online Zugang:https://www.fmmit.lviv.ua/index.php/fmmit/article/view/289
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Physico-mathematical modeling and informational technologies
Завантажити файл: Pdf

Institution

Physico-mathematical modeling and informational technologies
Beschreibung
Zusammenfassung:The problem of speeding up cross-currency transfers and mutual settlements between banks with the increasing amount of national electronic currencies, cryptocurrencies, and the overall volume of financial transactions can be considered as a routing problem. The solving time of this class of combinatorial  optimization  problems  can  be  significantly  reduced  by  using  hybrid  quantum-classical cloud services and heuristic algorithms, which provide approximate solutions for such problems. Numerical experiments were conducted on a hybrid service provided by the company D-Wave  using  the  quantum  annealing  algorithm  and  algorithms  from  the  networkx  library  to compare the speed of solving the traveling salesman problem for a fully connected graph with 105 vertices.  The  developed  routing  algorithms  provide  an  approximate  solution  to  TSP  or  VRP problems on D-Wave quantum computers in approximately 30 milliseconds.