Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.01977 v3 pith:2YNVBL62 submitted 2023-03-01 cs.ET cs.AIquant-ph

classification cs.ETcs.AIquant-ph
keywords packingreal-worldproblemsolvingbeenhybridinstancesitem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools