Multi-car paint shop optimization with quantum annealing

  title={Multi-car paint shop optimization with quantum annealing},
  author={Sheir Yarkoni and Alexander V. Alekseyenko and Michael Streif and David Von Dollen and Florian Neukart and Thomas B{\"a}ck},
  journal={2021 IEEE International Conference on Quantum Computing and Engineering (QCE)},
  • Sheir Yarkoni, A. Alekseyenko, +3 authors T. Bäck
  • Published 16 September 2021
  • Computer Science, Physics
  • 2021 IEEE International Conference on Quantum Computing and Engineering (QCE)
We present a generalization of the binary paint shop problem (BPSP) to tackle an automotive industry application, the multi-car paint shop (MCPS) problem. The objective of the optimization is to minimize the number of color switches between cars in a paint shop queue during manufacturing, a known NP-hard problem. We distinguish between different sub-classes of paint shop problems, and show how to formulate the basic MCPS problem as an Ising model. The problem instances used in this study are… Expand

Figures and Tables from this paper


Traffic Flow Optimization Using a Quantum Annealer
This paper shows how to map certain parts of the real-world traffic flow optimization problem to be suitable for quantum annealing, and shows that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum applications. Expand
Quantum Annealing Implementation of Job-Shop Scheduling
A quantum annealing solver for the renowned job-shop scheduling problem (JSP) is presented in detail. After formulating the problem as a time-indexed quadratic unconstrained binary optimizationExpand
Reverse quantum annealing approach to portfolio optimization problems
The best results in terms of expected time-to-solution as a function of number of variables for the hardest instances set are obtained by seeding the quantum annealer with a solution candidate found by a greedy local search and then performing a reverse annealing protocol. Expand
Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
The preliminary results show that for reasonable modeling choices, the most challenging subproblems which are programmable in the current devices are solved to optimality with 99% of probability within a second of annealing time. Expand
Quantum-Assisted Cluster Analysis on a Quantum Annealing Device
This work presents an algorithm for quantum-assisted cluster analysis (QACA) that makes use of the topological properties of a D-Wave 2000Q quantum processing unit (QPU) and explains how to represent and solve parts of these problems with the help of the QPU. Expand
Complexity results on a paint shop problem
A dynamic program is presented that solves a new combinatorial problem: Given a word w and restricted reservoirs of colored letters, synthesize w with a minimal number of color changes in polynomial time and is shown to be NP-complete. Expand
Complexity results on restricted instances of a paint shop problem for words
We study the following problem: an instance is a word with every letter occurring twice. A solution is a 2-coloring of its letters such that the two occurrences of every letter are colored withExpand
Tabu Search - Part I
  • F. Glover
  • Computer Science
  • INFORMS J. Comput.
  • 1989
The fundamental principles underlying tabu search as a strategy for combinatorial optimization problems are presented and more advanced considerations are examined, applying the basic ideas to special settings and outlining a dynamic move structure to insure finiteness. Expand
Quantum Annealing amid Local Ruggedness and Global Frustration
A recent Google study [Phys. Rev. X, 6:031015 (2016)] compared a D-Wave 2X quantum processing unit (QPU) to two classical Monte Carlo algorithms: simulated annealing (SA) and quantum Monte CarloExpand
Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
This work proposes to complement head-to-head scaling studies that compare quantum annealing machines to state-of-the-art classical codes with an approach that compares the performance of different algorithms and/or computing architectures on different classes of computationally hard tunable spin-glass instances. Expand