In recent years, Quantum Computing has been gaining increasing importance as more and more examples of Quantum Supremacy (demonstrating that a programmable quantum device can solve a problem that no classical computer can solve in any feasible amount of time) has been demonstrated by Google, Honeywell and other places where quantum computing research is underway.The potential of Quantum Computing is explored to address computational issues within the smart cities domain.Focusing in its application on the routing of garbage trucks.The garbage truck routing issue was studied and a simplified model of route planning was considered.A modified "Travelling Salesman Problem" (TSP) algorithm was applied, with added restrictions concerning the start and the end of the route.A few graphs from a TSP database were used.With each graph, the problem was formulated as a QUBO, and using a solver (Qbsolv), it was solved both by a classical computer (Laptop) and a Quantum Computer (Dwave Advantage System).Due to the limitation on time with the Dwave Quantum Computer, there was a limit to how many experiments that were possible to run on it.The samples show that as the complexity of the problem increases, so does its deviation from the "optimal result", but nonetheless the results obtained show that it is possible to obtain a "good enough" result that has practical real world applications.
In recent years, Quantum Computing has been gaining increasing importance as more and more examples of Quantum Supremacy (demonstrating that a programmable quantum device can solve a problem that no classical computer can solve in any feasible amount of time) has been demonstrated by Google, Honeywell and other places where quantum computing research is underway.The potential of Quantum Computing is explored to address computational issues within the smart cities domain.Focusing in its application on the routing of garbage trucks.The garbage truck routing issue was studied and a simplified model of route planning was considered.A modified "Travelling Salesman Problem" (TSP) algorithm was applied, with added restrictions concerning the start and the end of the route.A few graphs from a TSP database were used.With each graph, the problem was formulated as a QUBO, and using a solver (Qbsolv), it was solved both by a classical computer (Laptop) and a Quantum Computer (Dwave Advantage System).Due to the limitation on time with the Dwave Quantum Computer, there was a limit to how many experiments that were possible to run on it.The samples show that as the complexity of the problem increases, so does its deviation from the "optimal result", but nonetheless the results obtained show that it is possible to obtain a "good enough" result that has practical real world applications.
Modern computing techniques like quantum computing are based on the remarkable phenomena of quantum mechanics. With an increasing number of instances of quantum supremacy displaying that a programmable quantum device can overcome the challenge that no computer algorithm can solve in any reasonable amount of time being shown by Google, IBM, Honeywell, and other distinct positions where quantum computing research is being conducted, quantum computing has grown in significance in recent days. Ultimately, travelling salesman problem (TSP) method is used and gives additional constraints on the beginning and ending points of the routing path. Hence, the outcome collections demonstrate that it is possible to obtain a strong quality result that has significant real-world applications even though the samples show an increase in problem complexity.
Quantum computing (QC) is expected to solve incredibly difficult problems, including finding optimal solutions to combinatorial optimization problems. However, to date, QC alone has still been unable to demonstrate this capability except for small-sized problems. Hybrid approaches, where QC and classical computing work together, have shown the most potential for solving real-world-scale problems. This work aims to show that we can enhance a classical optimization algorithm with QC so that it can overcome this limitation. We present a new Hybrid Quantum-classical Tabu Search (HQTS) algorithm to solve the Capacitated Vehicle Routing Problem (CVRP). Based on our prior work, HQTS leverages QC for routing within a classical tabu search framework. The quantum component formulates the Traveling Salesman Problem (TSP) for each route as a Quadratic Unconstrained Binary Optimization (QUBO) and solves it using D-Wave’s Advantage system. Experiments investigate the impact of quantum routing frequency and starting solution methods. Across different starting solution methods, including quantum-based and classical heuristics, it shows minimal overall impact. HQTS achieved optimal or near-optimal solutions for several CVRP problems, outperforming other hybrid CVRP algorithms and significantly reducing the optimality gap relative to preliminary research. The experimental results demonstrate that more frequent quantum routing improves solution quality and runtime. The findings highlight the potential of integrating QC within meta-heuristic frameworks for complex optimization in vehicle routing problems.
This article explores the use of QUBO as a practical and educational framework for solving complex optimization problems. QUBO models are widely applicable across fields such as scheduling, routing, and resource allocation, and are compatible with classical, hybrid, and quantum solvers. We discuss the core principles behind QUBO, its connection to physical systems like the Ising model, and its growing relevance in research and education. To demonstrate the practical side, we apply QUBO to a real-world-inspired Multi-agent Route Planning problem, where the goal is to maximize the network coverage while minimizing the total overlap of vehicle-routes. This use-case helps illustrate how QUBO formulations can model trade-offs, encode constraints, and scale to larger problem sizes. In addition, we evaluate midsized instances of the problem on D-Wave Systems’ Advantage2 quantum annealer. The study aims to bridge theoretical optimization with hands-on experimentation, making it suitable for both teaching and applied research.
At land, sea and in the air mobility and traffic management offer a vast amount of problems with a large potential of optimization with quantum computers, e.g. service scheduling, route planning, or path optimization. Many of these problems can be described at a fundamental level by the traveling salesman problem (TSP), in which the shortest route while visiting each point exactly once is to be found [1]. The TSP has already received a lot of attention in the quantum computing community, for example, implementations for adiabatic quantum annealers exist and have been tested [2,3]. We investigate the TSP with a focus on going beyond qubits by employing continuous quantum systems. Using bosonic Qiskit we simulate potential algorithms for solving the TSP and compare their performance. [1] Flood, M. M., The traveling-salesman problem. Operations research, 4(1), 61-75, (1956). [2] Martoňák, Roman, Giuseppe E. Santoro, and Erio Tosatti., Quantum annealing of the traveling-salesman problem. Physical Review E 70.5: 057701, (2004). [3] Jain, S., Solving the traveling salesman problem on the d-wave quantum computer. Frontiers in Physics, 646, (2021).
Quantum computing has emerged as a promising computational paradigm with the potential to solve problems that are intractable for classical computers. This paper provides an overview of the current state of quantum computing, including its historical development, hardware advancements, applications, and challenges. Special attention is given to combinatorial optimization, which is considered one of the most promising application domains. The limitations of current quantum systems and future research directions are also discussed. This paper presents a comparative study between a conventional D-Wave-based simulated annealing approach and a proposed hybrid optimization model for solving largescale combinatorial optimization problems. The study focuses on benchmark problems, including AES, TSP gr24, and a real-world load balancing problem, all formulated as QUBO models. The D-Wave approach employs the dwave-neal simulated annealing engine with various parameter settings, while the proposed model introduces a decomposition-based framework combined with adaptive parameter control and iterative refinement. The experimental results demonstrate that the proposed model consistently outperforms the conventional approach in terms of solution quality, achieving significantly lower energy values across all problem instances. In particular, for the TSP gr24 problem, the proposed model achieves near-optimal solutions with substantially reduced computation time. For large-scale problems such as AES and load balancing, the proposed model maintains scalability and robustness, whereas the conventional approach suffers from increased computational cost and performance degradation. Although the proposed method introduces additional computational steps, its hybrid structure effectively mitigates limitations related to local minima, parameter sensitivity, and scalability. These findings indicate that integrating classical optimization techniques with quantum-inspired methods is essential for practical applications. The proposed model provides a promising framework for solving complex real-world optimization problems and highlights the importance of hybrid approaches in advancing quantum annealing technologies.
Abstract Traffic optimization remains a significant challenge in urban planning and transportation management. While efficient traffic optimization is crucial for enhancing urban mobility, reducing congestion, and promoting environmental sustainability, traditional computational methods often struggle with the complex, dynamic nature of traffic systems. Recent advances in quantum computing, particularly quantum annealing, offer promising new techniques that could revolutionize traffic flow optimization. This work systematically reviews the literature, starting with search term formulation and ending with the final set of articles. These articles are categorized into three groups: (1) traffic signal control, (2) traffic flow optimization, and (3) routing problems optimization (including vehicle routing problem and traveling salesman problem). The review critically examines current studies on quantum annealing-based traffic optimization, focusing on contributions, methods, solvers, problem suitability, key findings, benchmark fairness, and limitations. It identifies key challenges and provides recommendations for future research. Insights from this work offer researchers and practitioners a concise overview of current challenges and future directions in traffic optimization.