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.
@article{arxiv.2503.08711,
title = {A Beam Search Based Parallel Algorithm for the Two-Dimensional Strip Packing Problem},
author = {Yajie Wen and Defu Zhang},
journal= {arXiv preprint arXiv:2503.08711},
year = {2025}
}