Related papers: Solving a Real-World Package Delivery Routing Prob…
In this work we compare several new computational approaches to an inventory routing problem, in which a single product is shipped from a warehouse to retailers via an uncapacitated vehicle. We survey exact algorithms for the Traveling…
One of the problems frequently mentioned as a candidate for quantum advantage is that of selecting a portfolio of financial assets to maximize returns while minimizing risk. In this paper we formulate several real-world constraints for use…
Modern quantum annealers can find high-quality solutions to combinatorial optimisation objectives given as quadratic unconstrained binary optimisation (QUBO) problems. Unfortunately, obtaining suitable QUBO forms in computer vision remains…
We present a framework for efficiently solving Approximate Traveling Salesman Problem (Approximate TSP) for Quantum Computing Models. Existing representations of TSP introduce extra states which do not correspond to any permutation. We…
A neural solver and differentiable simulation of the quantum transmitting boundary model is presented for the inverse quantum transport problem. The neural solver is used to engineer continuous transmission properties and the differentiable…
The development of advanced quantum-classical algorithms is among the most prominent strategies in quantum computing. Numerous hybrid solvers have been introduced recently. Many of these methods are created ad hoc to address specific use…
The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that arises in various fields including transportation and logistics. The CVRP extends from the Vehicle Routing Problem (VRP), aiming to determine the most…
We address the applicability of a hybrid quantum-classical heuristics for practical railway rescheduling management problems. We build an integer linear programming model and solve it with D-Wave's quantum-classical hybrid solver (CQM) as…
This work focuses on exact methods for a Simultaneous Vehicle Routing and Crew Scheduling Problem in long-haul transport. Pickup-and-delivery requests with time windows must be fullfiled over a multi-day planning horizon. Unlike some…
Quantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, the problems need to be formulated as unconstrained binary models, taking…
An explicit algorithm for the travelling salesman problem is constructed in the framework of adiabatic quantum computation, AQC. The initial Hamiltonian for the AQC process admits canonical coherent states as the ground state, and the…
Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits of the quantum chip, from which a solution is obtained after…
This paper proposes a quantum algorithm for the capacitated vehicle routing problem with time windows (CVRPTW) based on Grover Search framework. This problem is often faced by Postal services in the context of package delivery or other…
Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of…
Applying near-term variational quantum algorithms to the problem of dynamic satellite network routing represents a promising direction for quantum computing. In this work, we provide a critical evaluation of two major approaches: static…
The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techniques. However, it is unclear if the current state of…
Quadratic unconstrained binary optimization problems (QUBOs) are intensively discussed in the realm of quantum computing and polynomial optimization. We provide a vast experimental study of semidefinite programming (SDP) relaxations of…
We study the load balanced capacitated vehicle routing problem (LBCVRP): the problem is to design a collection of tours for a fixed fleet of vehicles with capacity Q to distribute a supply from a single depot between a number of predefined…
Characterizing thermally activated transitions in high-dimensional rugged energy surfaces is a very challenging task for classical computers. Here, we develop a quantum annealing scheme to solve this problem. First, the task of finding the…
Optimization problems is one of the most challenging applications of quantum computers, as well as one of the most relevants. As a consequence, it has attracted huge efforts to obtain a speedup over classical algorithms using quantum…