Practical Effectiveness of Quantum Annealing for Shift Scheduling Problem

Natsuki Hamada, Kazuhiro Saito, Hideyuki Kawashima

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Quantum annealing (QA) is a novel computing approach for solving computationally demanding problems more rapidly than approaches using classical computers by exploiting parallelism in the variable state updates (spin updates). A number of previous studies have shown that QA performs well in benchmarking combinatorial optimization problems, but no works have evaluated QA in the shift scheduling problem. This paper formulates it for QA and evaluates the effectiveness of QA in comparison with other methods on a classical computer. We confirmed that QA is up to about 14 times faster than classical methods in obtaining high-quality solutions for several instances.

Original languageEnglish
Title of host publicationProceedings - 2022 IEEE 36th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages421-424
Number of pages4
ISBN (Electronic)9781665497473
DOIs
Publication statusPublished - 2022
Event36th IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2022 - Virtual, Online, France
Duration: 2022 May 302022 Jun 3

Publication series

NameProceedings - 2022 IEEE 36th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2022

Conference

Conference36th IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2022
Country/TerritoryFrance
CityVirtual, Online
Period22/5/3022/6/3

Keywords

  • Combinatorial optimization
  • Quantum annealing
  • Shift scheduling

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems
  • Software
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Practical Effectiveness of Quantum Annealing for Shift Scheduling Problem'. Together they form a unique fingerprint.

Cite this