2023
DOI: 10.1038/s41598-023-39013-9
|View full text |Cite
|
Sign up to set email alerts
|

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 (), considering different realistic charac… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
2
0
2

Year Published

2023
2023
2025
2025

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 30 publications
0
2
0
2
Order By: Relevance
“…This approach utilizes the augmented Lagrangian method to facilitate the incorporation of the packing constraints into the objective function and demonstrates the potential dynamics of quantum computation in solving the mixed palletizing problem. Other instances of quantum computation utilization are presented in [81,82]. In these articles, a hybrid quantum-classical framework for solving 3DBPPs is discussed, while also considering many constraints, such as package and bin dimensions, overweight items, dependencies among item categories, and preferences for item ordering.…”
Section: Quantum Computingmentioning
confidence: 99%
“…This approach utilizes the augmented Lagrangian method to facilitate the incorporation of the packing constraints into the objective function and demonstrates the potential dynamics of quantum computation in solving the mixed palletizing problem. Other instances of quantum computation utilization are presented in [81,82]. In these articles, a hybrid quantum-classical framework for solving 3DBPPs is discussed, while also considering many constraints, such as package and bin dimensions, overweight items, dependencies among item categories, and preferences for item ordering.…”
Section: Quantum Computingmentioning
confidence: 99%
“…Na presente versão, o motor executa várias combinações de heurísticas. Estas heurísticas referem-se a três momentos do fluxo: regras para ordenação dos itens para inserção (6); regra para a ordenação dos painéis de acordo com o item em inserção (12); regras para a divisão de um dado painel após inserção de um item no mesmo (6).…”
Section: Algoritmo E Heurísticas Aplicadasunclassified
“…A literatura existente demonstra o esforço e investimento em automatizar e otimizar estes processos em ambientes BIM [11], além da procura de algoritmos e heurísticas para problemas de Bin Packing incrementalmente mais eficientes [12].…”
Section: Introductionunclassified
“…In recent years, the rapid progress in manufacturing of quantum processing units (QPUs) and the development of hybrid quantum-classical workflows, not only for universal quantum computers (Abrams and Lloyd 1998;Brandhofer et al 2022;Chen et al 2023;Farhi et al 2014;Zheng 2021), but also for quantum annealers (Cohen et al 2020a(Cohen et al , 2020bElsokkary et al 2017;Grant et al 2021;Jacquier et al 2022;Orús et al 2019;Palmer et al 2022;Phillipson and Bhatia 2021;Romero et al 2023), has reignited interest in this type of problem. Meanwhile, quantum annealers have been shown to provide a quantum advantage for certain classically intractable problems (King et al 2023) and seem to provide a promising platform for solving quadratic binary optimization and integer quadratic optimization, even in the presence of hard and weak constraints.…”
Section: Introductionmentioning
confidence: 99%