20 citations · 39 across the 6 of their papers we have counts for
4 papers · 1 filter
An open-source heuristic to reboot 2D nesting research
Jeroen Gardeyn, Greet Vanden Berghe, Tony Wauters
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 p…
A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
Jeroen Gardeyn, Tony Wauters
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…
Decoupling Geometry from Optimization in 2D Irregular Cutting and Packing Problems: an Open-Source Collision Detection Engine
Jeroen Gardeyn, Greet Vanden Berghe, Tony Wauters
Addressing irregular cutting and packing (C&P) optimization problems poses two distinct challenges: the geometric challenge of determining whether or not an item can be placed feas…
A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
Sahar Chehrazad, Dirk Roose, Tony Wauters
We present a fast algorithm to solve nesting problems based on a semi-discrete representation of both the 2D non-convex pieces and the strip. The pieces and the strip are represent…