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 …

We consider the problem of packing a set of rectangular items into a strip of fixed width,
without overlap**, using minimum height. Items must be packed with their edges parallel …

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 …

Introduction: This paper addresses the two-dimensional strip-packing (2DSP) problem of
placing a set of rectangular pieces onto a fixed-width rectangular sheet to minimize the total …

This paper presents a Q-learning-based algorithm for sequence and orientation optimization
toward the 2D rectangular strip packing problem. The width-filled skyline is used to …

Many approaches exist for solving two dimensional rectangle-packing problems. Some rely
on multiple heuristic policies to detect suitable packing positions. Others resort to searching …

In practice the maximum usage of container space arises in many applications which is one
of the crucial economical requirements that have a wide impact on good transportation. A …

Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip
packing problem consists of orthogonally placing all the rectangles such that the height is …

This article presents an efficient heuristic placement algorithm, namely, a bidirectional
heuristic placement, for solving the two-dimensional rectangular knapsack packing problem …