The two dimensional strip packing problem occurs in industries such as metal, wood, glass, paper, and textiles. The problem involves cutting shapes from a larger stock sheet or ro...
We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90 rotations are allowed. Our main contribution is a polynomial-time al...
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...
Andrea Bettinelli, Alberto Ceselli, Giovanni Righi...
Abstract. This paper introduces a new tabu search algorithm for a twodimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of...