Optimizing the Production of Test Vehicles using Hybrid Constrained Quantum Annealing

• URL: http://arxiv.org/abs/2203.15421v1
• Date: Tue, 29 Mar 2022 10:36:20 GMT
• Title: Optimizing the Production of Test Vehicles using Hybrid Constrained Quantum Annealing
• Authors: Adam Glos, Akash Kundu, \"Ozlem Salehi
• Abstract summary: We model the problem in the framework of satisfiability and solve it by utilizing the hybrid constrained quadratic model (CQM) solver provided by D-Wave. We conclude that the performance of the CQM solver is comparable to classical solvers in optimizing the number of test vehicles.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Optimization of pre-production vehicle configurations is one of the challenges in the automotive industry. Given a list of tests requiring cars with certain features, it is desirable to find the minimum number of cars that cover the tests and obey the configuration rules. In this paper, we model the problem in the framework of satisfiability and solve it by utilizing the newly introduced hybrid constrained quadratic model (CQM) solver provided by D-Wave. The problem definition is based on the "Optimizing the Production of Test Vehicles" use case given in the BMW Quantum Computing Challenge. We formulate a constrained quadratic model for the problem and use a greedy algorithm to configure the cars. We benchmark the results obtained from the CQM solver with the results from the classical solvers like CBC (Coin-or branch and cut) and Gurobi. We conclude that the performance of the CQM solver is comparable to classical solvers in optimizing the number of test vehicles. As an extension to the problem, we describe how the scheduling of the tests can be incorporated into the model.

Related papers

• LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoning [56.273799410256075]
  The framework combines Monte Carlo Tree Search (MCTS) with iterative Self-Refine to optimize the reasoning path. The framework has been tested on general and advanced benchmarks, showing superior performance in terms of search efficiency and problem-solving capability.
  arXiv  Detail & Related papers  (2024-10-03T18:12:29Z)
• A Hybrid Quantum-Classical Approach to the Electric Mobility Problem [0.8796261172196743]
  We suggest a hybrid quantum-classical routine for the NP-hard Electric Vehicle Fleet Charging and Allocation Problem. We benchmark the performance of the decomposition technique with classical and quantum-inspired metaheuristics. The major advantage of the proposed approach is that it enables quantum-based methods for this realistic problem with many inequality constraints.
  arXiv  Detail & Related papers  (2023-10-04T12:14:56Z)
• Mixed-model Sequencing with Stochastic Failures: A Case Study for Automobile Industry [0.0]
  In the automotive industry, the sequence of vehicles to be produced is determined ahead of the production day. This paper proposes a two-stage program for the mixed-model sequencing (MMS) problem with product failures.
  arXiv  Detail & Related papers  (2023-06-22T01:09:18Z)
• Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors [48.68474702382697]
  Vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables.
  arXiv  Detail & Related papers  (2023-06-14T13:44:35Z)
• Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization [72.41480594026815]
  Constrained optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space. In this work, we encode arbitrary integer-valued equality constraints of the form Ax=b, directly into U(1) symmetric networks (TNs) and leverage their applicability as quantum-inspired generative models.
  arXiv  Detail & Related papers  (2022-11-16T18:59:54Z)
• Supply Chain Logistics with Quantum and Classical Annealing Algorithms [0.0]
  Noisy intermediate-scale quantum (NISQ) hardware is almost universally incompatible with full-scale optimization problems of practical importance. We investigate a problem of substantial commercial value, multi-truck vehicle routing for supply chain logistics, at the scale used by a corporation in their operations. Our work gives a set of techniques that can be adopted in contexts beyond vehicle routing to apply NISQ devices in a hybrid fashion to large-scale problems of commercial interest.
  arXiv  Detail & Related papers  (2022-05-09T17:36:21Z)
• Quantum Annealing for Vehicle Routing Problem with weighted Segment [0.0]
  The study presents a QUBO formulation to solve traffic congestion problems on certain roads. The resulting route selection by optimizing the distribution of the flow of alternative road vehicles based on the weighting of road segments. The simulations on the D-Wave quantum annealer show optimal results on the route deployment of several vehicles.
  arXiv  Detail & Related papers  (2022-03-25T06:38:18Z)
• Fast Feature Selection with Fairness Constraints [49.142308856826396]
  We study the fundamental problem of selecting optimal features for model construction. This problem is computationally challenging on large datasets, even with the use of greedy algorithm variants. We extend the adaptive query model, recently proposed for the greedy forward selection for submodular functions, to the faster paradigm of Orthogonal Matching Pursuit for non-submodular functions. The proposed algorithm achieves exponentially fast parallel run time in the adaptive query model, scaling much better than prior work.
  arXiv  Detail & Related papers  (2022-02-28T12:26:47Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• GPS: A new TSP formulation for its generalizations type QUBO [0.0]
  We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP) We overcome the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary variables. Finally, we tested whether the correctness of the formulation by entering it into a QUBO problem solver.
  arXiv  Detail & Related papers  (2021-10-23T07:10:24Z)
• Transformer-based Machine Learning for Fast SAT Solvers and Logic Synthesis [63.53283025435107]
  CNF-based SAT and MaxSAT solvers are central to logic synthesis and verification systems. In this work, we propose a one-shot model derived from the Transformer architecture to solve the MaxSAT problem.
  arXiv  Detail & Related papers  (2021-07-15T04:47:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.