Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.19306 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909754728644608 |
|---|---|
| author | Gardeyn, Jeroen Wauters, Tony |
| author_facet | Gardeyn, Jeroen Wauters, Tony |
| contents | This paper addresses the two-dimensional bin packing problem with guillotine constraints. The problem requires a set of rectangular items to be cut from larger rectangles, known as bins, while only making use of edge-to-edge (guillotine) cuts. The goal is to minimize the total bin area needed to cut all required items. This paper also addresses variants of the problem which permit 90° rotation of items and/or a heterogeneous set of bins. A novel heuristic is introduced which is based on the ruin and recreate paradigm combined with a goal-driven approach. When applying the proposed heuristic to benchmark instances from the literature, it outperforms the current state-of-the-art algorithms in terms of solution quality for all variants of the problem considered. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_19306 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints Gardeyn, Jeroen Wauters, Tony Computational Geometry This paper addresses the two-dimensional bin packing problem with guillotine constraints. The problem requires a set of rectangular items to be cut from larger rectangles, known as bins, while only making use of edge-to-edge (guillotine) cuts. The goal is to minimize the total bin area needed to cut all required items. This paper also addresses variants of the problem which permit 90° rotation of items and/or a heterogeneous set of bins. A novel heuristic is introduced which is based on the ruin and recreate paradigm combined with a goal-driven approach. When applying the proposed heuristic to benchmark instances from the literature, it outperforms the current state-of-the-art algorithms in terms of solution quality for all variants of the problem considered. |
| title | A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2508.19306 |