Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.13329 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911440666886144 |
|---|---|
| author | Gardeyn, Jeroen Berghe, Greet Vanden Wauters, Tony |
| author_facet | Gardeyn, Jeroen Berghe, Greet Vanden Wauters, Tony |
| contents | 2D nesting problems rank among the most challenging cutting and packing problems. Yet, despite their practical relevance, research over the past decade has seen remarkably little progress. One reasonable explanation could be that nesting problems are already solved to near optimality, leaving little room for improvement. However, as our paper demonstrates, we are not at the limit after all. This paper presents $\texttt{sparrow}$, an open-source heuristic approach to solving 2D irregular strip packing problems, along with ten new real-world instances for benchmarking. Our approach decomposes the optimization problem into a sequence of feasibility problems, where collisions between items are gradually resolved. $\texttt{sparrow}$ consistently outperforms the state of the art - in some cases by an unexpectedly wide margin. We are therefore convinced that the aforementioned stagnation is better explained by both a high barrier to entry and a widespread lack of reproducibility. By releasing $\texttt{sparrow}$'s source code, we directly address both issues. At the same time, we are confident there remains significant room for further algorithmic improvement. The ultimate aim of this paper is not only to take a single step forward, but to reboot the research culture in the domain and enable continued, reproducible progress. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_13329 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An open-source heuristic to reboot 2D nesting research Gardeyn, Jeroen Berghe, Greet Vanden Wauters, Tony Computational Geometry 2D nesting problems rank among the most challenging cutting and packing problems. Yet, despite their practical relevance, research over the past decade has seen remarkably little progress. One reasonable explanation could be that nesting problems are already solved to near optimality, leaving little room for improvement. However, as our paper demonstrates, we are not at the limit after all. This paper presents $\texttt{sparrow}$, an open-source heuristic approach to solving 2D irregular strip packing problems, along with ten new real-world instances for benchmarking. Our approach decomposes the optimization problem into a sequence of feasibility problems, where collisions between items are gradually resolved. $\texttt{sparrow}$ consistently outperforms the state of the art - in some cases by an unexpectedly wide margin. We are therefore convinced that the aforementioned stagnation is better explained by both a high barrier to entry and a widespread lack of reproducibility. By releasing $\texttt{sparrow}$'s source code, we directly address both issues. At the same time, we are confident there remains significant room for further algorithmic improvement. The ultimate aim of this paper is not only to take a single step forward, but to reboot the research culture in the domain and enable continued, reproducible progress. |
| title | An open-source heuristic to reboot 2D nesting research |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2509.13329 |