Two-dimensional rectangular strip packing problems belong to the broader class of Cutting
and Packing (C&P) problems, in which small items are required to be cut from or packed on …

In this paper, we explore the use of reference values (predictors) for the optimal objective
function value of hard combinatorial optimization problems, instead of bounds, obtained by …

Defining the algorithm capable of best fit the characteristics observed for a problem is a
complex task in the context of combinatorial optimization problems. As a decision-making …

This paper studies the two-dimensional strip packing problem with unloading constraints.
Given a set of items (represented by rectangles) belonging to different customers and a …

In this paper we present a hybrid metaheuristic approach called PVS (Progress and Verify
Strategy) for the two-dimensional strip packing problem (2SPP). PVS relies on two …

Two dimensional strip-packing problem (2DSPP) consists of packing a set of rectangular
items on one strip with a restriction of a maximal width and height. Because the conventional …

This paper introduces a new tabu search algorithm for a two-dimensional (2D) Strip Packing
Problem (2D-SPP). It integrates several key features: A direct representation of the problem …

This thesis focuses on construction methods for the Orthogonal Packing Problems,
particularly the two-dimensional strip packing problem. The Extreme Point Based …

This paper discusses a particular “packing” problem, namely the two dimensional strip
packing problem, where a finite set of objects have to be located in a strip of fixed width and …

Good algorithms exist for solving the 2D rectangular strip packing problem when the
objective is to minimize the amount of wasted material. However, in some applications other …