Two-dimensional (2D) irregular packing problems are widespread in manufacturing
industries such as shipbuilding, metalworking, automotive production, aerospace, clothing …

Cutting and packing problems have been a core area of research for many decades.
Irregular shape packing is one of the most recent variants to be widely researched and its …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

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 while …

The article is devoted to mathematical models and practical algorithms for solving the cutting
and packing (C&P) problem. We review and further enhance the main tool of our studies–phi …

The no-fit polygon is a construct that can be used between pairs of shapes for fast and
efficient handling of geometry within irregular two-dimensional stock cutting problems …

This paper presents a new heuristic algorithm for the two-dimensional irregular stock-cutting
problem, which generates significantly better results than the previous state of the art on a …

The nesting problem, also known as irregular packing problem, belongs to the generic class
of cutting and packing (C&P) problems. It differs from other 2-D C&P problems in the …

In this paper we present a new heuristic solution method for two-dimensional nesting
problems. It is based on a simple local search scheme in which the neighborhood is any …

The nesting problem is commonly encountered in sheet metal, clothing and shoe-making
industries. The nesting problem is a combinatorial optimization problem in which a given set …