Quantum Use Case #12: Warehouse layout and picking optimisation

Short answer: This use case involves applying quantum optimization algorithms to solve the warehouse layout problem (WLP) and related picking route optimization, which are NP-hard combinatorial challenges. Researchers have proposed reformulating these classical problems into quantum-compatible formats, such as Quadratic Unconstrained Binary Optimization (QUBO), to explore efficient solutions for medium and large instances. While the computational motivation is strong, current research indicates these approaches are in the research stage, with simulations and theoretical models rather than operational commercial deployment.

Problem Definition and Computational Challenge

The warehouse layout problem, also referred to as the warehouse slotting problem, aims to determine the optimal assignment of products to storage locations. The primary objective is to minimize the total travel distance required for picking operations. This problem is combinatorial in nature and is well-known to be NP-hard. Consequently, obtaining high-quality solutions for medium and large instances remains a significant computational challenge for classical computing methods. This difficulty has motivated recent research into applying quantum optimization algorithms to address the inefficiencies inherent in classical solvers when scaling up to complex warehouse configurations.

Quantum Reformulation Strategies

To leverage quantum hardware, researchers have focused on translating the classical mathematical models of the WLP into formats compatible with quantum annealing or gate-based models. One prominent approach involves reformulating the classical Quadratic Assignment Programming (QAP) model of the WLP into a Quadratic Unconstrained Binary Optimization (QUBO) model. This specific QUBO formulation is noted for avoiding the addition of slack variables, which can complicate the optimization landscape. By mapping the problem to a QUBO structure, researchers aim to utilize quantum annealing techniques to find low-energy states that correspond to high-quality layout solutions. This transformation allows the problem to be tackled by quantum processors designed to solve binary optimization tasks, although the practical efficacy on large-scale instances remains an area of active investigation.

Integrated Optimization of Layout and Assignment

Recent research has moved beyond optimizing the layout in isolation to consider joint optimization problems. Specifically, studies have explored the joint black-box optimization of warehouse layout and worker assignment using quantum annealing and factorization machines. In logistics warehouses, while many processes are automated, areas such as the receiving zone still rely heavily on manual work. Optimizing these areas requires considering multiple interrelated factors, including layout design and worker assignment. Previous research typically addressed these problems individually, but because they are closely related, jointly optimizing them is considered essential for improving overall efficiency. Quantum annealing is proposed as a method to handle this coupled complexity, allowing for simultaneous consideration of spatial and human resource variables within a single optimization framework.

Mobile Robot Picking and Batching

Another avenue of research applies quantum computing approaches to mobile robot order picking and batching. In this context, the warehouse is modeled with specific structural constraints, such as parallel corridors and transverse aisles that separate storage blocks. The picking strategy is based on minimizing the route and optimizing batch preparation. Researchers have proposed scenarios where a robot receives orders and calculates the most optimal sequence based on the coordinates of each product. This approach contemplates a single warehouse divided into blocks containing slots for products, with cross aisles reserved for navigation. While these models provide a framework for quantum-assisted route planning, they represent theoretical or simulated scenarios rather than deployed systems. The focus remains on demonstrating the feasibility of quantum algorithms in solving the underlying combinatorial routing and batching problems.

Current Status and Limitations

It is crucial to note that these applications are currently at the research stage. The sources reviewed consist of theoretical proposals, model reformulations, and simulated scenarios. There is no indication of commercial deployment or operational adoption in real-world logistics facilities. Claims of efficiency gains are based on the potential of quantum algorithms to handle NP-hard problems more effectively than classical heuristics, but practical implementation faces significant hurdles. Factors such as hardware noise, problem size limitations, and the complexity of mapping real-world constraints to quantum models remain unresolved. Therefore, while the quantum link to warehouse optimization is a valid area of academic inquiry, it should not be framed as an available commercial technology. The field is exploring the boundaries of what quantum computers can achieve in logistics, but operational integration remains distant.

FAQ

Is the warehouse layout problem solvable by classical computers?

The warehouse layout problem is NP-hard, meaning that finding optimal solutions for medium and large instances is computationally challenging for classical computers. This difficulty is the primary motivation for exploring quantum optimization algorithms as potential alternatives for high-quality solutions.

How is the problem adapted for quantum computers?

Researchers have proposed reformulating the classical Quadratic Assignment Programming (QAP) model into a Quadratic Unconstrained Binary Optimization (QUBO) model. This QUBO formulation avoids adding slack variables, making it compatible with quantum annealing approaches that solve binary optimization tasks.

Can quantum computers optimize worker assignment simultaneously?

Yes, research has proposed joint black-box optimization of warehouse layout and worker assignment using quantum annealing and factorization machines. This approach recognizes that layout design and worker assignment are closely related and should be optimized jointly rather than individually to improve overall warehouse efficiency.

Are these quantum solutions currently used in real warehouses?

No, these solutions are not currently used in real warehouses. The research reviewed indicates that these methods are in the research stage, involving theoretical models and simulations. There is no evidence of commercial deployment or operational adoption in actual logistics operations.

What role do mobile robots play in this quantum use case?

Mobile robots are considered in research scenarios for order picking and batching. Proposed models involve robots calculating optimal picking routes based on product coordinates within a structured warehouse layout. These scenarios are theoretical and aim to demonstrate the application of quantum optimization to routing and batching problems.