用并行束搜索提升二维矩形装箱效率，适合大规模优化场景。
A Beam Search Based Parallel Algorithm for the Two-Dimensional Strip Packing Problem
- 采用并行束搜索策略加速解空间探索
- 在标准测试集上优于多数现有算法
- 开源代码与数据集，便于复现与扩展
本文提出BSPA，一种基于束搜索的并行算法，用于求解二维条带装箱问题。研究首先综述了现有方法与技术路线，随后详细阐述BSPA算法设计。实验结果表明，该方法在多个基准数据集上表现出色，显著提升了求解效率与解的质量。为促进后续研究，论文公开了全部代码与测试数据集。
原文摘要 · Abstract (English)
This paper introduces BSPA, a parallel algorithm that leverages beam search to address the two-dimensional strip packing problem. The study begins with a comprehensive review of existing approaches and methodologies, followed by a detailed presentation of the BSPA algorithm. Experimental results demonstrate the effectiveness of the proposed method. To facilitate further research, both the code and datasets are publicly available.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。