Abstract
AbstractEfficient 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 characteristics, such as: (1) package and bin dimensions, (2) overweight restrictions, (3) affinities among item categories and (4) preferences for item ordering. permits the solving of real-world oriented instances of 3 dBPP, contemplating restrictions well appreciated by industrial and logistics sectors.
Funder
Eusko Jaurlaritza
Centro para el Desarrollo Tecnológico Industrial
Publisher
Springer Science and Business Media LLC
Reference34 articles.
1. Garey, M. R. & Johnson, D. S. Approximation algorithms for bin packing problems: A survey. In Analysis and Design of Algorithms in Combinatorial Optimization 147–172 (Springer, 1981).
2. Munien, C. & Ezugwu, A. E. Metaheuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications. J. Intell. Syst. 30, 636–663 (2021).
3. Delorme, M., Iori, M. & Martello, S. Bin packing and cutting stock problems: Mathematical models and exact algorithms. Eur. J. Oper. Res. 255, 1–20 (2016).
4. Martello, S., Pisinger, D. & Vigo, D. The three-dimensional bin packing problem. Oper. Res. 48, 256–267 (2000).
5. Lodi, A., Martello, S. & Vigo, D. Heuristic algorithms for the three-dimensional bin packing problem. Eur. J. Oper. Res. 141, 410–420 (2002).
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献