DeepAI AI Chat
Log In Sign Up

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

by   Sebastián V. Romero, et al.

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.


page 1

page 7


Benchmark dataset and instance generator for Real-World Three-Dimensional Bin Packing Problems

In this paper, a benchmark for real-world bin packing problems is propos...

Comparing several heuristics for a packing problem

Packing problems are in general NP-hard, even for simple cases. Since no...

Variable Neighborhood Search for the Bin Packing Problem with Compatible Categories

Bin Packing with Conflicts (BPC) are problems in which items with compat...

Open-end bin packing: new and old analysis approaches

We analyze a recently introduced concept, called the price of clustering...

A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem

The Two-dimensional Bin Packing Problem calls for packing a set of recta...

Applying Gene Expression Programming for Solving One-Dimensional Bin-Packing Problems

This work aims to study and explore the use of Gene Expression Programmi...

An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems

[libralesso_anytime_2020] proposed an anytime tree search algorithm for ...