• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

用于实际三维装箱问题的基准数据集和实例生成器。

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

作者信息

Osaba Eneko, Villar-Rodriguez Esther, V Romero Sebastián

机构信息

TECNALIA, Basque Research and Technology Alliance (BRTA), 48160 Derio, Spain.

出版信息

Data Brief. 2023 Jun 11;49:109309. doi: 10.1016/j.dib.2023.109309. eCollection 2023 Aug.

DOI:10.1016/j.dib.2023.109309
PMID:37388322
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC10300079/
Abstract

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: item and bin dimensions, weight restrictions, affinities among package categories preferences for package ordering and load balancing. Besides the data, we also offer an own developed Python script for the dataset generation, coined . 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.

摘要

在本文中,提出了一个针对实际装箱问题的基准测试。该数据集由12个实例组成,这些实例在大小方面具有不同程度的复杂性(包裹数量从38到53不等)以及用户定义的要求。实际上,在构建这些实例时考虑了几个面向实际的限制因素:物品和箱子尺寸、重量限制、包裹类别之间的亲和性、包裹排序偏好以及负载平衡。除了数据之外,我们还提供了一个自己开发的用于数据集生成的Python脚本,名为 。该基准测试最初是为了评估量子求解器的性能而提出的。因此,这组实例的特性是根据量子设备的当前限制设计的。此外,包含数据集生成器是为了允许构建通用基准测试。本文中引入的数据提供了一个基线,将鼓励量子计算研究人员致力于解决实际装箱问题。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d87d/10300079/f0c01ed4774a/gr3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d87d/10300079/3931e996effe/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d87d/10300079/f0c01ed4774a/gr3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d87d/10300079/3931e996effe/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d87d/10300079/f0c01ed4774a/gr3.jpg

相似文献

1
Benchmark dataset and instance generator for real-world three-dimensional bin packing problems.用于实际三维装箱问题的基准数据集和实例生成器。
Data Brief. 2023 Jun 11;49:109309. doi: 10.1016/j.dib.2023.109309. eCollection 2023 Aug.
2
Hybrid approach for solving real-world bin packing problem instances using quantum annealers.使用量子退火器解决实际装箱问题实例的混合方法。
Sci Rep. 2023 Jul 21;13(1):11777. doi: 10.1038/s41598-023-39013-9.
3
QAL-BP: an augmented Lagrangian quantum approach for bin packing.QAL-BP:一种用于装箱问题的增强拉格朗日量子方法。
Sci Rep. 2024 Mar 1;14(1):5142. doi: 10.1038/s41598-023-50540-3.
4
Optimizing e-commerce warehousing through open dimension management in a three-dimensional bin packing system.通过三维装箱系统中的开放维度管理优化电子商务仓储
PeerJ Comput Sci. 2023 Oct 9;9:e1613. doi: 10.7717/peerj-cs.1613. eCollection 2023.
5
A GAN-based genetic algorithm for solving the 3D bin packing problem.一种基于生成对抗网络的遗传算法,用于解决三维装箱问题。
Sci Rep. 2024 Apr 2;14(1):7775. doi: 10.1038/s41598-024-56699-7.
6
: A python based synthetic dataset generator for testing and validating control-oriented neural networks for building dynamics prediction.一种基于Python的合成数据集生成器,用于测试和验证面向控制的神经网络以进行建筑动力学预测。
MethodsX. 2023 Oct 26;11:102464. doi: 10.1016/j.mex.2023.102464. eCollection 2023 Dec.
7
Synthesising Diverse and Discriminatory Sets of Instances Using Novelty Search in Combinatorial Domains.在组合域中使用新颖性搜索合成多样且具有区分性的实例集。
Evol Comput. 2025 Mar 15;33(1):55-90. doi: 10.1162/evco_a_00350.
8
Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization.用于二次无约束二进制优化的量子启发式启发式求解器的基准测试。
Sci Rep. 2022 Feb 9;12(1):2146. doi: 10.1038/s41598-022-06070-5.
9
Integrating Heuristic Methods with Deep Reinforcement Learning for Online 3D Bin-Packing Optimization.将启发式方法与深度强化学习相结合用于在线3D装箱优化
Sensors (Basel). 2024 Aug 20;24(16):5370. doi: 10.3390/s24165370.
10
Materials science optimization benchmark dataset for multi-objective, multi-fidelity optimization of hard-sphere packing simulations.用于硬球堆积模拟多目标、多保真度优化的材料科学优化基准数据集。
Data Brief. 2023 Aug 10;50:109487. doi: 10.1016/j.dib.2023.109487. eCollection 2023 Oct.

引用本文的文献

1
Editorial: Introduction to the special issue "Data in Management and Decision Engineering".社论:“管理与决策工程中的数据”特刊引言
Data Brief. 2024 Jul 4;55:110711. doi: 10.1016/j.dib.2024.110711. eCollection 2024 Aug.
2
Hybrid approach for solving real-world bin packing problem instances using quantum annealers.使用量子退火器解决实际装箱问题实例的混合方法。
Sci Rep. 2023 Jul 21;13(1):11777. doi: 10.1038/s41598-023-39013-9.

本文引用的文献

1
Hybrid approach for solving real-world bin packing problem instances using quantum annealers.使用量子退火器解决实际装箱问题实例的混合方法。
Sci Rep. 2023 Jul 21;13(1):11777. doi: 10.1038/s41598-023-39013-9.