Irregular packing problems: A review of mathematical models
Irregular packing problems (also known as nesting problems) belong to the more general
class of cutting and packing problems and consist of allocating a set of irregular and regular …
class of cutting and packing problems and consist of allocating a set of irregular and regular …
Part decomposition and assembly-based (Re) design for additive manufacturing: A review
Additive Manufacturing (AM), also known as 3D printing, has been highlighted as a
complementary method to the traditional (subtractive and formative) manufacturing. This …
complementary method to the traditional (subtractive and formative) manufacturing. This …
Iterated local search: Framework and applications
The key idea underlying iterated local search is to focus the search not on the full space of
all candidate solutions but on the solutions that are returned by some underlying algorithm …
all candidate solutions but on the solutions that are returned by some underlying algorithm …
A tutorial in irregular shape packing problems
JA Bennell, JF Oliveira - Journal of the Operational Research …, 2009 - Taylor & Francis
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 …
Irregular shape packing is one of the most recent variants to be widely researched and its …
The dotted-board model: a new MIP model for nesting irregular shapes
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 …
of cutting and packing (C&P) problems. It differs from other 2-D C&P problems in the …
Fast neighborhood search for two-and three-dimensional nesting problems
J Egeblad, BK Nielsen, A Odgaard - European Journal of Operational …, 2007 - Elsevier
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 …
problems. It is based on a simple local search scheme in which the neighborhood is any …
A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
A Elkeran - European Journal of Operational Research, 2013 - Elsevier
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 …
industries. The nesting problem is a combinatorial optimization problem in which a given set …
Robust mixed-integer linear programming models for the irregular strip packing problem
Two-dimensional irregular strip packing problems are cutting and packing problems where
small pieces have to be cut from a larger object, involving a non-trivial handling of geometry …
small pieces have to be cut from a larger object, involving a non-trivial handling of geometry …
Level-set-based partitioning and packing optimization of a printable model
As the 3D printing technology starts to revolutionize our daily life and the manufacturing
industries, a critical problem is about to e-merge: how can we find an automatic way to …
industries, a critical problem is about to e-merge: how can we find an automatic way to …
Voxel-based solution approaches to the three-dimensional irregular packing problem
C Lamas-Fernandez, JA Bennell… - Operations …, 2023 - pubsonline.informs.org
Research on the three-dimensional (3D) packing problem has largely focused on packing
boxes for the transportation of goods. As a result, there has been little focus on packing …
boxes for the transportation of goods. As a result, there has been little focus on packing …