An Overview of Algorithms for Solving Vehicle Routing Problems in the Quantum-Classical Cloud
Introduction. The hope of solving the problem of the avalanche-like growth of requirements for computing power, essential for solving complex routing problems and other problems of combinatorial optimization, relies on the latest quantum computers, in the development of which governments and corpora...
Main Authors: | Leonid Hulianitskyi, Vyacheslav Korolyov, Oleksandr Khodzinskyi |
---|---|
Format: | Article |
Language: | English |
Published: |
V.M. Glushkov Institute of Cybernetics
2023-07-01
|
Series: | Кібернетика та комп'ютерні технології |
Subjects: | |
Online Access: | http://cctech.org.ua/13-vertikalnoe-menyu-en/473-abstract-23-2-3-arte |
Similar Items
-
Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
by: Siddharth Jain
Published: (2021-11-01) -
Quantum annealing for the adjuster routing problem
by: Naoya Mori, et al.
Published: (2023-03-01) -
Hybrid Classical–Quantum Branch-and-Bound Algorithm for Solving Integer Linear Problems
by: Claudio Sanavio, et al.
Published: (2024-04-01) -
A Systematic Literature Review of Quantum Computing for Routing Problems
by: Eneko Osaba, et al.
Published: (2022-01-01) -
A Research of the Influence of Quantum Annealing Parameters on the Quality of the Solution of the Number Factorization Problem
by: Vyacheslav Korolyov, et al.
Published: (2023-04-01)