Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quing International Journal of Innovative Research in Science and Engineering

A Comprehensive Review of Quantum Annealing for Combinatorial Routing Problems

A. Karunamurthy, V. Vasanth

Published Dec 30, 2023• 0 citations
Publisher
DOI
10.54368/qijirse.2.4.0011

Related papers

Quantum Annealing for Combinatorial Optimization in Large-Scale Network Routing

Jincheng Zhang

This paper investigates the application of quantum annealing to address the challenges of combinatorial optimization within large-scale network routing. Traditional classical algorithms frequently encounter significant computational bottlenecks when attempting to determine optimal routes across complex networks, often failing to scale effectively with increasing network size and complexity. Quantum annealing offers a potentially transformative approach by leveraging quantum mechanical effects to explore solution spaces more efficiently. This work outlines a methodology for mapping network routing problems – characterized by a vast number of possible routes – onto the quantum annealing hardware. We present a model for representing the problem, formulating it as an Ising model, and then detail the annealing process. The core claim is that quantum annealing can provide a viable solution for optimizing network routes, particularly in scenarios where classical methods are computationally intractable. We explore the underlying principles of quantum annealing, focusing on its ability to escape local minima and achieve a lower energy state, representing the optimal solution. The research aims to demonstrate the feasibility and potential advantages of employing quantum annealing in practical network routing applications, paving the way for more efficient and robust network designs.

•Sep 7, 2026•0 citations

**Based on Quantum Annealing Algorithm for Solving Combinatorial Optimization Problems**

Jincheng Zhang

•Aug 31, 2026•0 citations

Quantum Annealing Algorithms: State of the Art

Du Weilin, Li Bin, Yu Peng Tian

Journal of Computer Research and Development•Sep 15, 2008•2 citations

Large-Scale AGV Routing Based on Multi-FPGA SQA Acceleration

Thinh NGUYEN QUANG, Kosuke Matsuyama, Keisuke Shimizu +5 more

Enhancing the efficiency, safety, and speed of large-scale Automated Guided Vehicle (AGV) systems is critical to increasing the productivity of logistics warehouses. Studies using the latest quantum annealers such as "D-Wave Advantage" with over 5000 qubits have shown the potential of quantum annealing (QA) to rapidly optimize AGV routing. However, applying QA to complex and large-scale AGV routing problems is a challenging task due to insufficient consideration of intricate operational conditions, and also due to the insufficient number of qubits in quantum annealers. This paper proposes a refined combinatorial optimization problem that minimizes the total travel time of thousands of AGVs while enhancing safety and efficiency by avoiding collisions. To solve such large-scale optimization problems with thousands of variables, we also propose a novel system architecture containing a Simulated Quantum Annealing (SQA) accelerator using multiple FPGAs. The proposed SQA accelerator is capable of processing problems with over 50,000 variables, which could be a few tens to several hundred times larger than the problems processed on the "D-Wave Advantage". It addresses multiple combinatorial optimization problems across multiple FPGAs concurrently while processing each problem in a high degree of parallelism. We demonstrate the accurate operation of the proposed SQA accelerator using a real-world large-scale AGV system with over 1000 AGVs. According to the experimental results, we observed faster processing speed and better quality results over existing SQA solvers.

Asia and South Pacific Design Automation Conference (ASP-DAC)•Jan 20, 2025•2 citations

Quantum annealing for vehicle routing and scheduling problems

Alex Syrichas

Metaheuristic approaches to solving combinatorial optimization problems have many attractions. They sidestep the issue of combinatorial explosion; they return good results; they are often conceptually simple and straight forward to implement. There are also shortcomings. Optimal solutions are not guaranteed; choosing the metaheuristic which best fits a problem is a matter of experimentation; and conceptual differences between metaheuristics make absolute comparisons of performance difficult. There is also the difficulty of configuration of the algorithm - the process of identifying precise values for the parameters which control the optimization process. Quantum annealing is a metaheuristic which is the quantum counterpart of the well known classical Simulated Annealing algorithm for combinatorial optimization problems. This research investigates the application of quantum annealing to the Vehicle Routing Problem, a difficult problem of practical significance within industries such as logistics and workforce scheduling. The work devises spin encoding schemes for routing and scheduling problem domains, enabling an effective quantum annealing algorithm which locates new solutions to widely used benchmarks. The performance of the metaheuristic is further improved by the development of an enhanced tuning approach using fitness clouds as behaviour models. The algorithm is shown to be further enhanced by taking advantage of multiprocessor environments, using threading techniques to parallelize the optimization workload. The work also shows quantum annealing applied successfully in an industrial setting to generate solutions to complex scheduling problems, results which created extra savings over an incumbent optimization technique. Components of the intellectual property rendered in this latter effort went on to secure a patent-protected status.

•May 28, 2026•2 citations

Quantum Optimization Realized: Quantum Annealing for Combinatorial Spatial Problems in Practice

Amr Magdy

•Nov 3, 2025•0 citations
This paper investigates the application of quantum annealing to address the challenges of combinatorial optimization within large-scale network routing. Traditional classical algorithms frequently encounter significant computational bottlenecks when attempting to determine optimal routes across complex networks, often failing to scale effectively with increasing network size and complexity. Quantum annealing offers a potentially transformative approach by leveraging quantum mechanical effects to explore solution spaces more efficiently. This work outlines a methodology for mapping network routing problems – characterized by a vast number of possible routes – onto the quantum annealing hardware. We present a model for representing the problem, formulating it as an Ising model, and then detail the annealing process. The core claim is that quantum annealing can provide a viable solution for optimizing network routes, particularly in scenarios where classical methods are computationally intractable. We explore the underlying principles of quantum annealing, focusing on its ability to escape local minima and achieve a lower energy state, representing the optimal solution. The research aims to demonstrate the feasibility and potential advantages of employing quantum annealing in practical network routing applications, paving the way for more efficient and robust network designs.
Enhancing the efficiency, safety, and speed of large-scale Automated Guided Vehicle (AGV) systems is critical to increasing the productivity of logistics warehouses. Studies using the latest quantum annealers such as "D-Wave Advantage" with over 5000 qubits have shown the potential of quantum annealing (QA) to rapidly optimize AGV routing. However, applying QA to complex and large-scale AGV routing problems is a challenging task due to insufficient consideration of intricate operational conditions, and also due to the insufficient number of qubits in quantum annealers. This paper proposes a refined combinatorial optimization problem that minimizes the total travel time of thousands of AGVs while enhancing safety and efficiency by avoiding collisions. To solve such large-scale optimization problems with thousands of variables, we also propose a novel system architecture containing a Simulated Quantum Annealing (SQA) accelerator using multiple FPGAs. The proposed SQA accelerator is capable of processing problems with over 50,000 variables, which could be a few tens to several hundred times larger than the problems processed on the "D-Wave Advantage". It addresses multiple combinatorial optimization problems across multiple FPGAs concurrently while processing each problem in a high degree of parallelism. We demonstrate the accurate operation of the proposed SQA accelerator using a real-world large-scale AGV system with over 1000 AGVs. According to the experimental results, we observed faster processing speed and better quality results over existing SQA solvers.
Metaheuristic approaches to solving combinatorial optimization problems have many attractions. They sidestep the issue of combinatorial explosion; they return good results; they are often conceptually simple and straight forward to implement. There are also shortcomings. Optimal solutions are not guaranteed; choosing the metaheuristic which best fits a problem is a matter of experimentation; and conceptual differences between metaheuristics make absolute comparisons of performance difficult. There is also the difficulty of configuration of the algorithm - the process of identifying precise values for the parameters which control the optimization process. Quantum annealing is a metaheuristic which is the quantum counterpart of the well known classical Simulated Annealing algorithm for combinatorial optimization problems. This research investigates the application of quantum annealing to the Vehicle Routing Problem, a difficult problem of practical significance within industries such as logistics and workforce scheduling. The work devises spin encoding schemes for routing and scheduling problem domains, enabling an effective quantum annealing algorithm which locates new solutions to widely used benchmarks. The performance of the metaheuristic is further improved by the development of an enhanced tuning approach using fitness clouds as behaviour models. The algorithm is shown to be further enhanced by taking advantage of multiprocessor environments, using threading techniques to parallelize the optimization workload. The work also shows quantum annealing applied successfully in an industrial setting to generate solutions to complex scheduling problems, results which created extra savings over an incumbent optimization technique. Components of the intellectual property rendered in this latter effort went on to secure a patent-protected status.