About: New Hybrid Quantum Annealing Algorithms for Solving Vehicle Routing Problem

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: New Hybrid Quantum Annealing Algorithms for Solving Vehicle Routing Problem Goto Sponge NotDistinct Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : wasabi.inria.fr associated with source document(s)

Attributes	Values
type	Academic Article research paper schema:ScholarlyArticle
isDefinedBy	Covid-on-the-Web dataset
title	New Hybrid Quantum Annealing Algorithms for Solving Vehicle Routing Problem
Creator	Borowski, Micha Burczyk, Miron Gora, Katarzyna Karnas, Krystian Król, Artur Kutwin, Matyjasek, Damian Szewczyk, Micha
source	PMC
abstract	We introduce new hybrid algorithms, DBSCAN Solver and Solution Partitioning Solver, which use quantum annealing for solving Vehicle Routing Problem (VRP) and its practical variant: Capacitated Vehicle Routing Problem (CVRP). Both algorithms contain important classical components, but we also present two other algorithms, Full QUBO Solver and Average Partitioning Solver, which can be run only on a quantum processing unit (without CPU) and were prototypes which helped us develop better hybrid approaches. In order to validate our methods, we run comprehensive tests using D-Wave’s Leap framework on well-established benchmark test cases as well as on our own test scenarios built based on realistic road networks. We also compared our new quantum and hybrid methods with classical algorithms - well-known metaheuristics for solving VRP and CVRP. The experiments indicate that our hybrid methods give promising results and are able to find solutions of similar or even better quality than the tested classical algorithms.
has issue date	2020-05-25(xsd:dateTime)
bibo:doi	10.1007/978-3-030-50433-5_42
has license	no-cc
sha1sum (hex)	7e6ef9e7a113e47d418ed3340a74ea042ca68371
schema:url	https://doi.org/10.1007/978-3-030-50433-5_42
resource representing a document's title	New Hybrid Quantum Annealing Algorithms for Solving Vehicle Routing Problem
has PubMed Central identifier	PMC7304725
schema:publication	Computational Science - ICCS 2020
resource representing a document's body	covid:7e6ef9e7a113e47d418ed3340a74ea042ca68371#body_text
is schema:about of	covid:arg/7e6ef9e7a113e47d418ed3340a74ea042ca68371 named entity 'DBSCAN' named entity 'D-Wave' named entity 'benchmark test' named entity 'recursive' named entity 'quantum annealing' named entity 'dynamic programming' named entity 'heuristics' named entity 'simulated annealing' named entity 'quantum processing' named entity '1, 2' named entity 'maximum difference' named entity 'simulated annealing' named entity 'recursive' named entity 'quantum computers' named entity 'combinatorial optimization' named entity 'TSP' named entity 'vertices' named entity 'VRP' named entity 'QUBO' named entity 'qubits' named entity 'vertices' named entity 'VRP' named entity 'clustering algorithm' named entity 'directed edges' named entity 'DBSCAN' named entity 'TSP' named entity 'benchmark test' named entity 'vertex' named entity 'QPU' named entity 'recursive' named entity 'VRP' named entity 'Vehicle Routing Problem' named entity 'QUBO' named entity 'QUBO' named entity 'QUBO' named entity 'graph' named entity 'VRP' named entity 'AVS' named entity 'vertices' named entity 'CPU' named entity 'D-Wave' named entity 'VRP' named entity 'computationally difficult' named entity 'TSP' named entity 'CPU' named entity 'OpenStreetMap' named entity 'VRP' named entity 'adiabatic quantum computers' named entity 'algorithm' named entity 'TSP' named entity 'qubits' named entity 'VRPTW' named entity 'VRP' named entity 'QUBO' named entity 'VRP' named entity 'vertices' named entity 'SPS' named entity 'recursive' named entity 'recursive' named entity 'recursively' named entity 'SPS' named entity 'DBSCAN' named entity 'simulated annealing' named entity 'metaheuristics' named entity 'combinatorial optimization' named entity 'QPU' named entity 'DBSCAN' named entity 'D-Wave' named entity 'TSP' named entity '1, 2' named entity 'simulated annealing' named entity 'quantum annealing' named entity 'dynamic programming' named entity 'D-Wave' named entity 'optimization problem'

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software