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 …
Voxel-based solution approaches to the three-dimensional irregular packing problem
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 …
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 …
A biased random key genetic algorithm for open dimension nesting problems using no-fit raster
We consider two NP-hard open dimension nesting problems for which a set of items has to
be packed without overlap** into a two-dimensional bin in order to minimize one or both …
be packed without overlap** into a two-dimensional bin in order to minimize one or both …
Raster penetration map applied to the irregular packing problem
Among the most complex problems in the field of 2-dimensional cutting & packing are
irregular packing problems, in which items may have a more complex geometry. These …
irregular packing problems, in which items may have a more complex geometry. These …
A clique covering MIP model for the irregular strip packing problem
The irregular strip packing problem consists in the cutting of a set of two-dimensional pieces
from an object of fixed width using the minimum possible length. Despite its economic …
from an object of fixed width using the minimum possible length. Despite its economic …
[HTML][HTML] Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
S Umetani, S Murakami - European journal of operational research, 2022 - Elsevier
We consider the irregular strip packing problem of rasterized shapes, where a given set of
pieces of irregular shapes represented in pixels should be placed into a rectangular …
pieces of irregular shapes represented in pixels should be placed into a rectangular …
A separation and compaction algorithm for the two-open dimension nesting problem using penetration-fit raster and obstruction map
Nesting Problems, which are important subjects in the cutting and packing field, involve
convex and nonconvex polygons and are common in several industries. These irregular …
convex and nonconvex polygons and are common in several industries. These irregular …
Visualizing data as objects by DC (difference of convex) optimization
In this paper we address the problem of visualizing in a bounded region a set of individuals,
which has attached a dissimilarity measure and a statistical value, as convex objects. This …
which has attached a dissimilarity measure and a statistical value, as convex objects. This …
[HTML][HTML] A particle swarm optimization algorithm for a 2-D irregular strip packing problem
MA Shalaby, M Kashkoush - 2013 - scirp.org
Two-Dimensional Irregular Strip Packing Problem is a classical cutting/packing problem.
The problem is to assign, a set of 2-D irregular-shaped items to a rectangular sheet. The …
The problem is to assign, a set of 2-D irregular-shaped items to a rectangular sheet. The …