A Beam Search Based Parallel Algorithm for the Two-Dimensional Strip Packing Problem

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Wen, Yajie, Zhang, Defu
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909534710136832
author Wen, Yajie
Zhang, Defu
author_facet Wen, Yajie
Zhang, Defu
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2503_08711
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A Beam Search Based Parallel Algorithm for the Two-Dimensional Strip Packing Problem
Wen, Yajie
Zhang, Defu
Optimization and Control
Artificial Intelligence
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.
title A Beam Search Based Parallel Algorithm for the Two-Dimensional Strip Packing Problem
topic Optimization and Control
Artificial Intelligence
url https://arxiv.org/abs/2503.08711