Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers

Abstract

Efficient packing of items into bins is a common daily task. Known as Bin Packing Problem, it has been intensively studied in the field of artificial intelligence, thanks to the wide interest from industry and logistics. Since decades, many variants have been proposed, with the three-dimensional Bin Packing Problem as the closest one to real-world use cases. We introduce a hybrid quantum-classical framework for solving real-world three-dimensional Bin Packing Problems (Q4RealBPP), considering different realistic characteristics, such as: i) package and bin dimensions, ii) overweight restrictions, iii) affinities among item categories and iv) preferences for item ordering. Q4RealBPP permits the solving of real-world oriented instances of 3dBPP, contemplating restrictions well appreciated by industrial and logistics sectors.

11 pages, 5 figures. Paper submitted for its review in Scientific Reports

References in corpus (3)

• Quantum Computing: Towards Industry Reference Problems
• Benchmark dataset and instance generator for Real-World Three-Dimensional Bin Packing Problems
• Quantum and quantum-inspired optimization for solving the minimum bin packing problem

Cited by in corpus (5)

• PauliComposer: Compute Tensor Products of Pauli Matrices Efficiently
• Quantum computing approach to realistic ESG-friendly stock portfolios
• Benchmark dataset and instance generator for Real-World Three-Dimensional Bin Packing Problems
• Solving Logistic-Oriented Bin Packing Problems Through a Hybrid Quantum-Classical Approach
• Digitized Counter-Diabatic Quantum Optimization for Bin Packing Problem