A systematic literature review of quantum computing for routing problems
Quantum Computing is drawing a significant attention from the current scientific community.
The potential advantages offered by this revolutionary paradigm has led to an upsurge of …
The potential advantages offered by this revolutionary paradigm has led to an upsurge of …
Efficient quantum algorithm for solving travelling salesman problem: An IBM quantum experience
The famous Travelling Salesman Problem (TSP) is an important category of optimization
problems that is mostly encountered in various areas of science and engineering. Studying …
problems that is mostly encountered in various areas of science and engineering. Studying …
Quantum Path Integral Approach for Vehicle Routing Optimization With Limited Qubit
The Vehicle Routing Problem (VRP) is a crucial combinatorial optimization problem in
transportation, logistics, and supply chain management. Quantum computing has gained …
transportation, logistics, and supply chain management. Quantum computing has gained …
New ant colony optimization algorithm for the traveling salesman problem
W Gao - International Journal of Computational Intelligence …, 2020 - Springer
As one suitable optimization method implementing computational intelligence, ant colony
optimization (ACO) can be used to solve the traveling salesman problem (TSP). However …
optimization (ACO) can be used to solve the traveling salesman problem (TSP). However …
Modified ant colony optimization with improved tour construction and pheromone updating strategies for traveling salesman problem
W Gao - Soft Computing, 2021 - Springer
To improve ant colony optimization (ACO) for traveling salesman problem (TSP), its two
main strategies which are tour construction and pheromone updating have been modified …
main strategies which are tour construction and pheromone updating have been modified …
Variational amplitude amplification for solving QUBO problems
We investigate the use of amplitude amplification on the gate-based model of quantum
computing as a means for solving combinatorial optimization problems. This study focuses …
computing as a means for solving combinatorial optimization problems. This study focuses …
Gaussian amplitude amplification for quantum pathfinding
We study an oracle operation, along with its circuit design, which combined with the Grover
diffusion operator boosts the probability of finding the minimum or maximum solutions on a …
diffusion operator boosts the probability of finding the minimum or maximum solutions on a …
Circuit Design of Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems
Quantum search algorithms, such as Grover's algorithm, are expected to efficiently solve
constrained combinatorial optimization problems. However, implementing a quantum search …
constrained combinatorial optimization problems. However, implementing a quantum search …
[PDF][PDF] Small traveling salesman problems
RH Warren - Journal of Advances in Applied Mathematics, 2017 - Citeseer
This paper illustrates fundamental principles about small traveling salesman problems
(TSPs) which are a current application for quantum annealing computers. The 2048 qubit …
(TSPs) which are a current application for quantum annealing computers. The 2048 qubit …
Embedding All Feasible Solutions of Traveling Salesman Problem by Divide-and-Conquer Quantum Search
Quantum search algorithms, such as the Grover algorithm, are investigated as one of the
ways to solve a traveling salesman problem (TSP). In TSP, the quantum search starts from …
ways to solve a traveling salesman problem (TSP). In TSP, the quantum search starts from …