About: The Multi-Service Location Set Covering Problem is an extension of the well-known Set Covering Problem. It arises in practical applications where a set of physical locations need to be equipped with services to satisfy demand within a certain area, while minimizing costs. In this paper we formulate the problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, apply the hybrid framework of the D-Wave quantum annealer to solve it, and investigate the feasibility of this approach. To improve the often suboptimal initial solutions found on the D-Wave system, we develop a hybrid quantum/classical optimization algorithm that starts from the seed solution and iteratively creates small subproblems that are more efficiently solved on the D-Wave but often still converge to feasible and improved solutions of the original problem. Finally we suggest some opportunities for increasing the accuracy and performance of our algorithm.   Goto Sponge  NotDistinct  Permalink

An Entity of Type : fabio:Abstract, within Data Space : covidontheweb.inria.fr associated with source document(s)

AttributesValues
type
value
  • The Multi-Service Location Set Covering Problem is an extension of the well-known Set Covering Problem. It arises in practical applications where a set of physical locations need to be equipped with services to satisfy demand within a certain area, while minimizing costs. In this paper we formulate the problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, apply the hybrid framework of the D-Wave quantum annealer to solve it, and investigate the feasibility of this approach. To improve the often suboptimal initial solutions found on the D-Wave system, we develop a hybrid quantum/classical optimization algorithm that starts from the seed solution and iteratively creates small subproblems that are more efficiently solved on the D-Wave but often still converge to feasible and improved solutions of the original problem. Finally we suggest some opportunities for increasing the accuracy and performance of our algorithm.
Subject
  • Machine learning algorithms
  • Operations research
  • Combinatorics
  • Technology companies established in 1999
  • Mathematical problems
  • Quantum information science
  • Quantum computing
  • Computational problems
  • Companies based in Burnaby
  • Computer hardware companies
  • Privately held companies of Canada
  • Technology companies of Canada
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
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