We survey the main formulations and solution methods for two-dimensional orthogonal
cutting and packing problems, where both items and bins are rectangles. We focus on exact …

Over the years, methods and algorithms have been extensively studied to solve variations of
the rectangular two-dimensional strip packing problem (2D-SPP), in which small rectangles …

This paper addresses the capacitated vehicle routing problem with two-dimensional loading
constraints (2L-CVRP), which is a generalized capacitated vehicle routing problem in which …

We study the strip packing problem, in which a set of two-dimensional rectangular items has
to be packed in a rectangular strip of fixed width and infinite height, with the aim of …

We introduce a new bin packing problem, termed the circle bin packing problem with circular
items (CBPP-CI). The problem involves packing all the circular items into multiple identical …

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 overlapping, using minimum height. Items must be packed with their edges parallel …

In light of the existing practical applications of the two-dimensional loading on vehicle
scheduling and many-to-many supply-demand relationships between suppliers and …

Cutting and packing problems have been widely studied in the last decades, mainly due to
the variety of industrial applications where the problems emerge. This paper presents an …

This paper proposes the hybrid adaptive genetic algorithm (HAGA) as an improved method
for solving the NP-hard two-dimensional rectangular packing problem to maximize the filling …