Irregular packing problems: A review of mathematical models

AAS Leao, FMB Toledo, JF Oliveira… - European Journal of …, 2020 - Elsevier
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 …

Two-dimensional irregular packing problems: A review

B Guo, Y Zhang, J Hu, J Li, F Wu, Q Peng… - Frontiers in Mechanical …, 2022 - frontiersin.org
Two-dimensional (2D) irregular packing problems are widespread in manufacturing
industries such as shipbuilding, metalworking, automotive production, aerospace, clothing …

Improved evolutionary algorithm for parallel batch processing machine scheduling in additive manufacturing

J Zhang, X Yao, Y Li - International Journal of Production Research, 2020 - Taylor & Francis
With the increasing prosperity of additive manufacturing, the 3D-printing shop scheduling
problem has presented growing importance. The scheduling of such a shop is imperative for …

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 …

[PDF][PDF] Dense, Interlocking-Free and Scalable Spectral Packing of Generic 3D Objects.

Q Cui, V Rong, D Chen, W Matusik - ACM Trans. Graph., 2023 - voxelmatters.com
1: 2• Cui et al. its practical importance, such as in robotic packaging [Wang and Hauser
2019], 3D printing [Chen et al. 2015; Yao et al. 2015], transportation [Egeblad et al. 2010] …

A branch & bound algorithm for cutting and packing irregularly shaped pieces

R Alvarez-Valdes, A Martinez, JM Tamarit - International Journal of …, 2013 - Elsevier
Cutting and packing problems involving irregular shapes, usually known as Nesting
Problems, are common in industries ranging from clothing and footwear to furniture and …

HAPE3D—a new constructive algorithm for the 3D irregular packing problem

X Liu, J Liu, A Cao, Z Yao - Frontiers of Information Technology & …, 2015 - Springer
We propose a new constructive algorithm, called HAPE3D, which is a heuristic algorithm
based on the principle of minimum total potential energy for the 3D irregular packing …

A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem

EK Burke, G Kendall, G Whitwell - INFORMS Journal on …, 2009 - pubsonline.informs.org
The best-fit heuristic is a simple yet powerful one-pass approach for the two-dimensional
rectangular stock-cutting problem. It had achieved the best published results on a wide …

A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums

JA Bennell, X Song - Computers & Operations Research, 2008 - Elsevier
The nofit polygon is a powerful and effective tool for handling the geometric requirements of
solution approaches to irregular cutting and packing problems. Although the concept was …

Load factor optimization for the auto carrier loading problem

C Jäck, J Gönsch… - Transportation …, 2023 - pubsonline.informs.org
The distribution of passenger vehicles is a complex task and a high cost factor for
automotive original equipment manufacturers (OEMs). On the way from the production plant …