2 citations · 5 across the 7 of their papers we have counts for
4 papers · 2 filters
An Advanced Hybrid Quantum Tabu Search Approach to Vehicle Routing Problems
James B. Holliday, Eneko Osaba, Khoa Luu
Quantum computing (QC) is expected to solve incredibly difficult problems, including finding optimal solutions to combinatorial optimization problems. However, to date, QC alone is…
Comparative Analysis of Classical and Quantum-Inspired Solvers: A Preliminary Study on the Weighted Max-Cut Problem
Aitor Morais, Eneko Osaba, Iker Pastor +1
Combinatorial optimization is essential across numerous disciplines. Traditional metaheuristics excel at exploring complex solution spaces efficiently, yet they often struggle with…
Optimizing Package Delivery with Quantum Annealers: Addressing Time-Windows and Simultaneous Pickup and Delivery
Eneko Osaba, Esther Villar-Rodriguez, Pablo Miranda-Rodriguez +1
Recent research at the intersection of quantum computing and routing problems has been highly prolific. Much of this work focuses on classical problems such as the Traveling Salesm…
Advanced Quantum Annealing Approach to Vehicle Routing Problems with Time Windows
James B. Holliday, Darren Blount, Eneko Osaba +1
In this paper, we explore the potential for quantum annealing to solve realistic routing problems. We focus on two NP-Hard problems, including the Traveling Salesman Problem with T…