Annals of Operations Research

Optimal solving of a binary knapsack problem on a D-Wave quantum machine and its implementation in production systems

Wojciech Bożejko, Anna Burduk, Jarosław Pempera, Mariusz Uchroński, Mieczysław Wodecki

Published May 13, 2024• 19 citations

Abstract

Abstract The efficient management of complex production systems is a challenge in today’s logistics. In the field of intelligent and sustainable logistics, the optimization of production batches, especially in the context of a rapidly changing product range, requires fast and precise computational solutions. This paper explores the potential of quantum computers for solving these problems. Traditional computational methods are often limited when it comes to optimizing complex logistics systems. In response to these challenges, the paper proposes the use of a hybrid algorithm that combines quantum technologies with classical computational methods. Such integration allows the computational power of both types of technologies to be harnessed, leading to faster and more efficient identification of optimal solutions. In this work, we consider the knapsack problem, a classic NP-hard optimization problem that is commonly used to verify the effectiveness of new algorithm construction methods. The algorithm presented is based on the Branch and Bound method and aims to ensure solution optimality in the context of the non-determinism of quantum computers. Within the algorithm, computations are performed alternately on a classical processor and a quantum processor. In addition, the lower and upper bounds of the objective function are computed in constant time using the D-Wave quantum machine.

DOI: 10.1007/s10479-024-06025-1

Related papers

Optimal Solving of a Scheduling Problem Using Quantum Annealing Metaheuristics on the D-Wave Quantum Solver

Wojciech Bożejko, Ryszard Klempous, Jarosław Pempera +4 more

Accurately solving discrete optimization problems is still a serious challenge for classical computing systems. Despite significant progress, it is still impossible to optimally solve examples of the size found in real-world applications. This article examines the problem of scheduling tasks on one machine. Each task has an associated execution time, desired completion date, and a late penalty feature weight. The order of executing tasks should be determined in a manner that minimizes the sum of delay costs. Despite the simplicity of the formulation, this problem is NP-hard and is representative of optimization challenges encountered in the practice of production control, management, and logistics.In this work, we propose using a quantum computing environment to solve it. The main disadvantage of calculations on quantum computers is their nondeterminism. Therefore, there is no guarantee of optimality of solutions to discrete optimization problems determined on a quantum computer.We propose a novel approach to constructing hybrid algorithms that guarantee the optimality of the solution. The algorithm for solving the task scheduling problem considered here is based on the branch and bound method. Calculations are performed alternately on a classical computer and a quantum computer. The lower and upper bounds of the criterion function are determined on a quantum computer. Computational experiments were performed on the D-Wave quantum computer. In small examples, the algorithm runs faster and generates significantly fewer solution tree vertices than its counterpart running on a classic computer. For larger examples, the proposed runtime-constrained method, acting as a heuristic, is an interesting alternative to using quantum computing hardware in relation to classical approaches based on silicon computers.

IEEE Transactions on Systems Man and Cybernetics SystemsOct 2, 202422 citations

A Quantum Global Optimization Algorithm: Application to the Knapsack Problem

Mohamed Yassine Cherif, Wided Lejouad Chaari, Olfa Belkahla Driss

Abstract Solving combinatorial optimization problems represents a challenge for researchers, especially hard NP-complete problems that are commonly handled through heuristic methods providing approximate solutions. The emergence of quantum computing, which enables performing parallel computation, raises hope for solving such problems within a reasonable time frame. This paper proposes a quantum global optimization algorithm to solve combinatorial optimization problems intended to provide an improved performance. The proposed algorithm aims to amplify the probability of selecting the global optimum of the objective function defining the addressed problem using a specific variant of Grover’s search based on simultaneously exploring all comparison cases of possible solutions to recognize the right one. The paper also includes the study of precision and runtime of the presented concept and introduces a version of the proposed algorithm addressing the knapsack problem, along with its execution results and a comparison with other competing algorithms.

Jun 15, 20260 citations

Optimal solving of a scheduling problem using quantum annealing metaheuristics on the D-Wave quantum solver

Wojciech Bożejko, Ryszard Klempous, Jarosław Pempera +4 more

This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible. The main disadvantage of calculations on quantum computers is their non-determinism. For optimization problems, of course, it is possible to get surprisingly good results but without a guarantee of the actual optimality of the result, i.e, an assurance that there exists no better solution which could potentially be found by the quantum machine. In this paper, we propose an novel approach that provides such a guarantee of optimality. We generate a solution that is optimal in the strict mathematical sense, without probabilistic considerations. To accomplish this, we use the D-Wave quantum machine working as a sampler implementing quantum annealing -- an approach considered a hardware metaheuristic -- to obtain upper and lower bounds on the value of the objective function of the problem under consideration. Then, we use the Branch and Bound scheme controlled by quantum annealing. This allows us to obtain very quickly -- in constant time -- the boundaries of the considered subproblems. Our approach is a combination of calculations realized on a quantum machine controlled by procedures implemented on a classical computer, allowing us to generate optimal solutions to the NP-hard problems of task scheduling on a single machine with a total weighted tardiness criterion. The proposed quantum algorithm shows a significant advantage over the classical CPU approach both in terms of calculation time and the number of generated solution tree nodes.

Apr 26, 20230 citations

A Quantum Global Optimization Algorithm: Application to the Knapsack Problem

Mohamed Yassine Cherif, Wided Lejouad Chaari, Olfa Belkahla Driss

Abstract Solving combinatorial optimization problems represents a challenge for researchers, especially hard NP-complete problems that are commonly handled through heuristic methods providing approximate solutions. The emergence of quantum computing, which enables performing parallel computation, raises hope for solving such problems within a reasonable time frame. This paper proposes a quantum global optimization algorithm to solve combinatorial optimization problems intended to provide an improved performance. The proposed algorithm aims to amplify the probability of selecting the global optimum of the objective function defining the addressed problem using a specific variant of Grover’s search based on simultaneously exploring all comparison cases of possible solutions to recognize the global optimum. The paper also includes the study of precision and runtime of the presented concept and introduces a version of the proposed algorithm addressing the knapsack problem, along with its execution results and a comparison with other competing algorithms

Mar 23, 20260 citations

Quantum annealing‐driven branch and bound for the total weighted tardiness traveling salesman problem on the D‐Wave quantum computer

Wojciech Bożejko, Mariusz Uchroński, Mieczysław Wodecki

Abstract The transportation problem considered in this work consists of minimizing the sum of penalties for tardiness in the delivery of the product from the base to clients. We propose an innovative method for constructing hybrid algorithms using quantum annealing that guarantees the optimality of the solution. The hybrid algorithm alternately performs calculations on a classical computer equipped with a silicon CPU and a quantum annealer with a QPU processor. The entire method is based on the branch and bound scheme. The lower and upper bounds are calculated on the QPU, while the CPU is responsible for organizing the calculations, recalling the solution tree. The problem under consideration is of great practical importance because it is a component of many complex issues related to solving the traveling repairmen problem, which are very difficult or even impossible to solve today using classical methods. Undoubtedly, an important application of quantum computers in the future is NP‐hard optimization tasks related to transportation scheduling and logistics.

International Transactions in Operational ResearchJan 21, 20260 citations

A Quantum Global Optimization Algorithm: Application to the Knapsack Problem

Mohamed Yassine Cherif, Wided Lejouad Chaari, Olfa Belkahla Driss

Abstract Solving combinatorial optimization problems represents a challenge for researchers, especially hard NP-complete problems that are commonly handled through heuristic methods providing approximate solutions. The emergence of quantum computing, which enables performing parallel computation, raises hope for solving such problems within a reasonable time frame. This paper proposes a quantum global optimization algorithm for solving combinatorial optimization problems with improved performance and runtime approaching Grover’s optimal time of quantum search. The algorithm determines the global optimum of the objective function defining the addressed problem using an enhanced application of Grover’s search by simultaneously exploring all comparison cases of possible solutions without requiring iterative operations, unlike previous approaches, which affect performance and runtime. The paper also introduces a version of the proposed algorithm for solving the knapsack problem, along with its execution results and a comparison with other competing algorithms.

Jan 12, 20260 citations