Benchmark dataset and instance generator for real-world three-dimensional bin packing problems

被引:4
|
作者
Osaba, Eneko [1 ]
Villar-Rodriguez, Esther [1 ]
Romero, Sebastian V. [1 ]
机构
[1] TECNALIA, Basque Res & Technol Alliance BRTA, Derio 48160, Spain
来源
DATA IN BRIEF | 2023年 / 49卷
关键词
Optimization; Bin packing problem; Quantum computing; Quantum annealer; Operations research;
D O I
10.1016/j.dib.2023.109309
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
In this article, a benchmark for real-world bin packing problems is proposed. This dataset consists of 12 instances of varying levels of complexity regarding size (with the number of packages ranging from 38 to 53) and user-defined requirements. In fact, several real-world-oriented restrictions were taken into account to build these instances: i) item and bin dimensions, ii) weight restrictions, iii) affinities among package categories iv) preferences for package ordering and v) load balancing. Besides the data, we also offer an own developed Python script for the dataset generation, coined Q4RealBPP-DataGen. The benchmark was initially proposed to evaluate the performance of quantum solvers. Therefore, the characteristics of this set of instances were designed according to the current limitations of quantum devices. Additionally, the dataset generator is included to allow the construction of general-purpose benchmarks. The data introduced in this article provides a baseline that will encourage quantum computing researchers to work on real-world bin packing problems. (c) 2023 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ )
引用
收藏
页数:10
相关论文
共 50 条
  • [21] A GRASP/Path Re linking algorithm for two-and three-dimensional multiple bin-size bin packing problems
    Alvarez-Valdes, R.
    Parreno, F.
    Tamarit, J. M.
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (12) : 3081 - 3090
  • [22] EVALUATION OF DEFOGGING: A REAL-WORLD BENCHMARK DATASET, A NEW CRITERION AND BASELINES
    Zhao, Shiyu
    Zhang, Lin
    Huang, Shuaiyi
    Shen, Ying
    Zhao, Shengjie
    Yang, Yukai
    2019 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO (ICME), 2019, : 1840 - 1845
  • [23] A solution of three-dimensional polyomino packing problems
    Kimoto, Kouki
    Tsuji, Hiroyuki
    Murai, Yasuyuki
    Tokumasu, Shinji
    2007 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-8, 2007, : 584 - +
  • [24] A Look-Forward Heuristic for Packing Spheres into a Three-Dimensional Bin
    Akeb, Hakim
    FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2014, 2014, 2 : 397 - 404
  • [25] Online Three-Dimensional Bin Packing: A DRL Algorithm with the Buffer Zone
    Zhang, Jiawei
    Shuai, Tianping
    FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2024, 49 (01) : 63 - 74
  • [26] A MIP-based slicing heuristic for three-dimensional bin packing
    Samir Elhedhli
    Fatma Gzara
    Yi Feng Yan
    Optimization Letters, 2017, 11 : 1547 - 1563
  • [27] Extreme point-based heuristics for three-dimensional bin packing
    Crainic, Teodor Gabriel
    Perboli, Guido
    Tadei, Roberto
    INFORMS JOURNAL ON COMPUTING, 2008, 20 (03) : 368 - 384
  • [28] The Pallet Loading Problem: Three-dimensional bin packing with practical constraints
    Gzara, Fatma
    Elhedhli, Samir
    Yildiz, Burak C.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 287 (03) : 1062 - 1074
  • [29] Guided local search for the three-dimensional bin-packing problem
    Faroe, O
    Pisinger, D
    Zachariasen, M
    INFORMS JOURNAL ON COMPUTING, 2003, 15 (03) : 267 - 283
  • [30] New lower bounds for the three-dimensional finite bin packing problem
    Boschetti, MA
    DISCRETE APPLIED MATHEMATICS, 2004, 140 (1-3) : 241 - 258